Saddle point criteria and duality in multiobjective programming via an η-approximation method
From MaRDI portal
Publication:3365655
DOI10.1017/S1446181100009962zbMATH Open1123.90343OpenAlexW1974958764MaRDI QIDQ3365655FDOQ3365655
Authors: 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
Recommendations
- scientific article; zbMATH DE number 5879517
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- An \(\eta\)-approximation method for multiobjective program involving invex functions
- Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
- Saddle point criteria for second order \(\eta\)-approximated vector optimization problems.
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Pre-invex functions in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- An \(\eta\)-approximation method in nonlinear vector optimization
- Optimality conditions in multiobjective differentiable programming
- Multiobjective duality with invexity
- A new approach to multiobjective programming with a modified objective function
- 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
Cited In (14)
- Mixed Lagrange function in minimax fractional programming problems
- Saddle point criteria in multiobjective fractional programming involving exponential invexity
- AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
- Title not available (Why is that?)
- Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
- An \(\eta\)-approximation method for multiobjective program involving invex functions
- Saddle point criteria for second order \(\eta\)-approximated vector optimization problems.
- Title not available (Why is that?)
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- Second order modified objective function method for twice differentiable vector optimization problems over cone constraints
- Mixed Type Duality and Saddle Point Criteria for Multiobjective Programming Problems with Nonsmooth Generalized Invexity
- Extragradient method for finding a saddle point in a multicriteria problem with dynamics
- Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
- A new approach to multiobjective programming with a modified objective function
This page was built for publication: Saddle point criteria and duality in multiobjective programming via an η-approximation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3365655)
