Optimality criteria in \(E\)-convex programming

DOI10.1016/S0960-0779(00)00036-9zbMath1026.90093MaRDI QIDQ1862381

Yanyan Li

Publication date: 19 March 2003

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Optimality and mixed duality in multiobjective \(E\)-convex programming, Generalization of some important theorems to E-midconvex functions, A combined interactive approach for solving E-convex multiobjective nonlinear programming problem, The \(F\)-inclusion property and \(F\)-convexity in normed spaces, Characterization of efficient solutions of multi-objective \(E\)-convex programming problems, Optimality of \(E\)-pseudoconvex multi-objective programming problems without constraint qualifications, Second order \((F,\alpha ,\rho ,d,E)\)-convex function and the duality problem, Optimality conditions for \(E\)-differentiable vector optimization problems with the multiple interval-valued objective function, Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function, (F, K, b)-vex sets and some related properties, E-convexity and its generalizations, Strongly E-convex sets and strongly E-convex functions

Cites Work

• On sufficiency of the Kuhn-Tucker conditions
• Uniqueness of solution in linear programming
• B-vex functions
• \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
• Convex Transformable Programming Problems and Invexity