ε-approximate solutions in multiobjective optimization
From MaRDI portal
Publication:4227987
DOI10.1080/02331939808844406zbMATH Open0916.90242OpenAlexW1986940126MaRDI QIDQ4227987FDOQ4227987
Authors: Zhongfei Li, Shouyang Wang 
Publication date: 2 February 1999
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939808844406
Recommendations
- On approximate efficiency in multiobjective programming
- On approximate solutions in multiobjective optimization
- A sufficient condition for \( (\varepsilon ,\bar \varepsilon)\)-approximate quasi properly solutions of multiobjective optimization problems
- On approximating weakly/properly efficient solutions in multi-objective programming
Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)
Cites Work
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon approximate solutions for multiobjective programming problems
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Nonconvex separation theorems and some applications in vector optimization
- A generalization of ekellandz’s variational principle
- Epsilon efficiency
- \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces
- Approximate saddle-point theorems in vector optimization
- Stability results for approximately efficient solutions
- Compromise solutions and estimation of the noninferior set
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- Compromise solutions, domination structures, and Salukvadze's solution
- Complete efficiency and interdependencies between objective functions in vector optimization
- Lagrange multipliers and saddle points in multiobjective programming
- Proper Efficiency in Nonconvex Multicriteria Programming
- A gap between multiobjective optimization and scalar optimization
- Approximate necessary conditions for locally weak Pareto optimality
- Penalty functions in ε-programming and ε-minimax problems
Cited In (41)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On approximate solutions in multiobjective optimization
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Title not available (Why is that?)
- On approximate starshapedness in multiobjective optimization
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- A sufficient condition for \( (\varepsilon ,\bar \varepsilon)\)-approximate quasi properly solutions of multiobjective optimization problems
- Equivalent \(\varepsilon\)-efficiency notions in vector optimization
- A note on \(\varepsilon\)-properly efficient solutions in multi-objective optimization
- Limit behavior of approximate proper solutions in vector optimization
- A combined scalarizing method for multiobjective programming problems
- Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
- Ekeland variational principles involving set perturbations in vector equilibrium problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- Title not available (Why is that?)
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Characterizing ϵ-properly efficient solutions
- On approximate solutions in vector optimization problems via scalarization
- Approximate quasi solutions of multiobjective optimization problems
- On approximate efficiency in multiobjective programming
- An Extension of the MOON2/MOON2R Approach to Many-Objective Optimization Problems
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Cone characterizations of approximate solutions in real vector optimization
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Sequential optimality conditions for multiobjective fractional programming problems
- On approximate efficiency for nonsmooth robust vector optimization problems
- A COMPUTATIONAL APPROACH BASED ON THE \epsilon-CONSTRAINT METHOD IN MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- A modified Quasi-Newton method for vector optimization problem
- A note on approximate proper efficiency in linear fractional vector optimization
- Improving the min-max method for multiobjective programming
- Robust solution of nonconvex global optimization problems
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Two Types of Approximate Saddle Points
- \(\varPhi\)-strict local efficient solution for multiobjective programming problems
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
This page was built for publication: ε-approximate solutions in multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227987)
