\((p,r)\)-invexity in multiobjective programming.

DOI10.1016/S0377-2217(02)00696-3zbMath1053.90115OpenAlexW1996601382MaRDI QIDQ1410324

Tadeusz Antczak

Publication date: 14 October 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00696-3

zbMATH Keywords

optimality conditionsdualityMultiobjective programming(weak) Pareto optimal solution(strictly) \((p,r)\)-invex function with respect to \(\eta\)

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Sufficient optimality criteria and duality for multiobjective variational control problems with B-(p,r)-invex functions, Some properties of semi-\(E\)-preinvex maps in Banach spaces, An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity, Exponential type vector variational-like inequalities and nonsmooth vector optimization problems, Infine functions and nonsmooth multiobjective optimization problems, Unnamed Item, Exponential type vector variational-like inequalities and vector optimization problems with exponential type invexities, Optimality and invexity in optimization problems in Banach algebras (spaces), Nonlinear programming with \(E\)-preinvex and local \(E\)-preinvex functions, Multiobjective Problems with Nonsmooth Equality Constraints, On \(G\)-invex multiobjective programming. II: Duality, On \(G\)-invex multiobjective programming. I: Optimality, AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS, Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity

Cites Work

• The essence of invexity
• Optimality conditions in multiobjective differentiable programming
• Multiobjective duality with invexity
• On sufficiency of the Kuhn-Tucker conditions
• Necessary conditions for optimality of nondifferentiable convex multiobjective programming
• Proper efficiency and the theory of vector maximization
• What is invexity?
• Necessary and sufficient conditions in constrained optimization
• A duality theorem for non-linear programming
• Invex functions and constrained local minima
• On generalised convex mathematical programming
• Proper efficiency conditions and duality for multiobjective programming problems involving semilocally invex functions
• r-convex functions
• Generalized convexity in multiobjective programming
• \((p,r)\)-invex sets and functions
• On \((p,r)\)-invexity-type nonlinear programming problems.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item