Outcome space partition of the weight set in multiobjective linear programming
From MaRDI portal
Publication:1579630
DOI10.1023/A:1004605810296zbMath1028.90051OpenAlexW1549610687MaRDI QIDQ1579630
Publication date: 14 September 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004605810296
Multi-objective and goal programming (90C29) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization ⋮ On nadir points of multiobjective integer programming problems ⋮ New multi-objective optimization model for tourism systems with fuzzy data and new approach developed epsilon constraint method ⋮ Ordinal optimization through multi-objective reformulation ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems ⋮ Weight set decomposition for weighted rank and rating aggregation: an interpretable and visual decision support tool ⋮ Criteria and dimension reduction of linear multiple criteria optimization problems ⋮ A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming ⋮ Algebra of efficient sets for multiobjective complex systems ⋮ A new duality approach to solving concave vector maximization problems ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ PolySCIP ⋮ Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming ⋮ The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces ⋮ Primal-dual simplex method for multiobjective linear programming ⋮ Multi-objective integer programming: an improved recursive algorithm ⋮ Constructing efficient solutions structure of multiobjective linear programming ⋮ Fully piecewise linear vector optimization problems ⋮ Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces ⋮ A primal-dual simplex algorithm for bi-objective network flow problems ⋮ Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces ⋮ New multi-objective optimization model for tourism systems with fuzzy data and new algorithm for solving this model ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving multiple objective linear programs in objective space
- Theory of multiobjective optimization
- Analysis of the objective space in multiple objective linear programming
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- Admissible points of a convex polyhedron
- A representation of the set of feasible objectives in multiple objective linear programs
- Linear multiobjective programming
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- The structure of admissible points with respect to cone dominance
- Generating all maximal efficient faces for multiple objective linear programs
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming
- Hybrid approach for solving multiple-objective linear programs in outcome space
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- 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
- Finding all maximal efficient faces in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- Proper efficiency and the theory of vector maximization
- Multiple Objective Linear Programming with Parametric Criteria Coefficients
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Identifying Efficient Vectors: Some Theory and Computational Results
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- An algorithm for nonconvex programming problems
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- On a property of polyhedral sets
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Algorithms for the vector maximization problem
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Nonlinear Programming in Banach Space
- Convex Analysis
