Relaxation of constraints in lexicographic multiobjective programming problems
From MaRDI portal
Publication:3454858
DOI10.1080/02331934.2014.929785zbMath1327.90290OpenAlexW1984246092MaRDI QIDQ3454858
Esmaile Khorram, Narges Rastegar
Publication date: 27 November 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.929785
multiobjective optimizationefficient solutionslexicographic optimizationweighted sum scalarization\(\epsilon\)-constraint scalarization
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Numerical methods of relaxation type (49M20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Survey of multi-objective optimization methods for engineering
- Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs
- A minimax theorem for vector-valued functions in lexicographic order
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Theory of multiobjective optimization
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- Linear lexicographic optimization
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- On the transformation of lexicographic nonlinear multiobjective programs to single objective programs
- A lexicographic optimization algorithm
- Proper efficiency and the theory of vector maximization
- A novel multi-objective optimization method based on an approximation model management technique
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- The stability of lexicographic optimization problems
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Counterexample and optimality conditions in differentiable multiobjective programming
