AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
DOI10.1017/S1446181108000096zbMATH Open1163.90699OpenAlexW2123439314MaRDI QIDQ3524074FDOQ3524074
Authors: Tadeusz Antczak 
Publication date: 8 September 2008
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446181108000096
Recommendations
- An \(\eta\)-approximation method in nonlinear vector optimization
- 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
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- \(\eta\)-approximation method for non-convex multiobjective variational problems
nonsmooth multiobjective programming\(V\)-invex function with respect to \(\eta\)(weak) Pareto optimal point\(\eta\)-approximated vector optimization problem
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)
Cites Work
- Theory of multiobjective optimization
- Title not available (Why is that?)
- On sufficiency of the Kuhn-Tucker conditions
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- Nonsmooth invexity
- Invex functions and constrained local minima
- On generalised convex mathematical programming
- Stability and Sensitivity Analysis in Convex Vector Optimization
- An \(\eta\)-approximation method in nonlinear vector optimization
- Optimality conditions in multiobjective differentiable programming
- Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
- A characterization of weakly efficient points
- A new approach to multiobjective programming with a modified objective function
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- On duality for weakly minimized vector valued optimization problems
- Quasimin and quasisaddlepoint for vector optimization
Cited In (10)
- The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
- Title not available (Why is that?)
- Characterizations of solvability of nonlinear nonconvex vectorial optimization problems in Banach spaces by \(\eta\)-approximation approach
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- \(\eta\)-pseudolinearity in multiobjective programming using the bifunctions class
- \(\eta\)-approximation method for non-convex multiobjective variational problems
- A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions
- Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
- An \(\eta\)-approximation method in nonlinear vector optimization
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems
This page was built for publication: AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524074)
