New closedness results for efficient sets in multiple objective mathematical programming
From MaRDI portal
Publication:1307268
DOI10.1006/jmaa.1999.6541zbMath0973.90070OpenAlexW2056829124MaRDI QIDQ1307268
Publication date: 5 December 2001
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1999.6541
mathematical programmingmultiple objectivenecessary condition and several sufficient conditions for the closedness of the efficient sets
Related Items
Optimality conditions for metrically consistent approximate solutions in vector optimization, Weakly and properly nonessential objectives in multiobjective optimization problems, The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems, S-strictly quasi-concave vector maximisation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimization of a quasi-concave function over an efficient set
- Interactive multiple objective optimization: Survey. I: Continuous case
- Theory of multiobjective optimization
- Careful usage of pessimistic values is needed in multiple objectives optimization
- On efficient sets in vector maximum problems - A brief survey
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Multiobjective programming and planning
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Generating all maximal efficient faces for multiple objective linear programs
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- Nonlinear multiobjective optimization
- Finding all maximal efficient faces in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- Connectedness of the efficient set in strictly quasiconcave vector maximization
- Connectedness of the efficient set for three-objective quasiconcave maximization problems
- On functions whose local minima are global
- On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
- Strictly quasi-convex (concave) functions and duality in mathematical programming
- Proper efficiency and the theory of vector maximization
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Optimization over the efficient set using an active constraint approach
- Connectedness in Multiple Linear Fractional Programming
- Multiple Objective Linear Fractional Programming
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Subdefinite Matrices and Quadratic Forms
- Linear programming with multiple objective functions: Step method (stem)
- Optimization over the efficient set
