A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
From MaRDI portal
Publication:1892603
DOI10.1007/BF01099463zbMath0835.90082OpenAlexW2077462977MaRDI QIDQ1892603
Publication date: 19 June 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01099463
Related Items
Utility function programs and optimization over the efficient set in multiple-objective decision making, Unnamed Item, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, Criteria and dimension reduction of linear multiple criteria optimization problems, Some characterizations of ideal points in vector optimization problems, Primal and dual algorithms for optimization over the efficient set, Some geometrical aspects of the efficient line in vector optimization, Further analysis of an outcome set-based algorithm for multiple-objective linear programming, Hybrid approach for solving multiple-objective linear programs in outcome space, Outcome space partition of the weight set in multiobjective linear programming, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Maximizing a concave function over the efficient or weakly-efficient set, A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program, Global maximization of UTA functions in multi-objective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving multiple objective linear programs in objective space
- An existence result for maximizations with respect to cones
- On the domination property in vector optimization
- Constructing the set of efficient objective values in multiple objective linear programs
- Efficiency and proper efficiency in vector maximization with respect to cones
- Theory of multiobjective optimization
- Existence theorems in vector optimization
- The domination property in multicriteria optimization
- Analysis of the objective space in multiple objective linear programming
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Stability in multicriteria optimization
- Multiobjective programming and planning
- On a domination property for vector maximization with respect to cones
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Complete efficiency and the initialization of algorithms for multiple objective programming
- A representation of the set of feasible objectives in multiple objective linear programs
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Existence of efficient solutions for vector maximization problems
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- The structure of admissible points with respect to cone dominance
- Generating all maximal efficient faces for multiple objective linear programs
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- On the existence of efficient points in locally convex spaces
- Determination of the efficient set in multiobjective linear programming
- Connectedness of the efficient point sets in quasiconcave vector maximization
- Density of the set of positive proper minimal points in the set of minimal points
- Proper efficiency and the theory of vector maximization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- A Generalization of a Theorem of Arrow, Barankin, and Blackwell
- Existence and characterization of efficient decisions with respect to cones
- Testing for complete efficiency in a vector maximization problem
- Finding all efficient extreme points for multiple objective linear programs
- An Existence Theorem in Vector Optimization
- On the Existence of Pareto Efficient Points
- Convex Analysis
