Necessary and Sufficient Global Optimality Conditions for Convex Maximization Revisited
نویسندگان
چکیده
منابع مشابه
Global Maximum of a Convex Function: Necessary and Sufficient Conditions
In this note we prove that an extended-real-valued lower semi-continuous convex function Φ defined on a reflexive Banach space X achieves its supremum on every nonempty bounded and closed convex set of its effective domain Dom Φ, if and only if the restriction of Φ to Dom Φ is sequentially continuous with respect to the weak topology on the underlying space X .
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملNecessary and Sufficient Conditions for Local Controllability and Time Optimality
Introduction. Let M be an analytic n manifold and # = {X : a e A} a collection of analytic vector fields on M. A continuous map M, T > 0, is called a solution of,_!, tt)9 i = 1, —, k. We denote by s...
متن کاملNecessary and Sufficient Optimality Conditions for Fuzzy Linear Programming
This paper is concerned with deriving necessary and sufficient optimality conditions for a fuzzy linear programming problem. Toward this end, an equivalence between fuzzy and crisp linear programming problems is established by means of a specific ranking function. Under this setting, a main theorem gives optimality conditions which do not seem to be in conflict with the so-called Karush-Kuhn-Tu...
متن کاملOptimality conditions in convex optimization revisited
The phrase convex optimization refers to the minimization of a convex function over a convex set. However the feasible convex set need not be always described by convex inequalities. In this article we consider a convex feasible set which are described by inequality constraints which are locally Lipschitz and not necessarily convex and need not be smooth. We show that if the Slater’s constraint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1998
ISSN: 0022-247X
DOI: 10.1006/jmaa.1997.5745