Saddle point criteria and duality in multiobjective programming via an η-approximation method

DOI10.1017/S1446181100009962zbMath1123.90343OpenAlexW1974958764MaRDI QIDQ3365655

Tadeusz Antczak

Publication date: 23 January 2006

Published in: The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL: http://www.austms.org.au/Publ/ANZIAM/V47P2/2224.html

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (6)

Mixed Lagrange function in minimax fractional programming problems ⋮ Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method ⋮ AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS ⋮ Saddle point criteria in multiobjective fractional programming involving exponential invexity ⋮ Second order modified objective function method for twice differentiable vector optimization problems over cone constraints ⋮ Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints

Cites Work

• Optimality conditions in multiobjective differentiable programming
• Multiobjective duality with invexity
• Pre-invex functions in multiple objective optimization
• On sufficiency of the Kuhn-Tucker conditions
• A new approach to multiobjective programming with a modified objective function
• An \(\eta\)-approximation method in nonlinear vector optimization
• On duality for weakly minimized vector valued optimization problems
• Quasimin and quasisaddlepoint for vector optimization
• An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions

This page was built for publication: Saddle point criteria and duality in multiobjective programming via an η-approximation method