Generating all maximal efficient faces for multiple objective linear programs
From MaRDI portal
Publication:1252160
DOI10.1007/BF00935493zbMath0393.90087OpenAlexW2046361522MaRDI QIDQ1252160
I. A. Kouada, J. G. Ecker, N. S. Hegner
Publication date: 1980
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00935493
Related Items
An algorithm for optimizing over the weakly-efficient set, Optimizing a linear function over an efficient set, Random problem genertion and the computation of efficient extreme points in multiple objective linear programming, A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions, Analysis of the objective space in multiple objective linear programming, Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives, Computational experience concerning payoff tables and minimum criterion values over the efficient set, A common formula to compute the efficient sets of a class of multiple objective linear programming problems, A graph-based algorithm for the multi-objective optimization of gene regulatory networks, A multiobjective based approach for mathematical programs with linear flexible constraints, SOLVING A SPECIAL CLASS OF MULTIPLE OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS, Finding a minimal efficient solution of a convex multiobjective program, A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs, Distributional efficiency in multiobjective stochastic linear programming, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, Efficient curve fitting: an application of multiobjective programming, Linear programming with partial information, Bicriteria linear fractional programming, Relaxation analysis in linear vectorvalued maximization, Maximal descriptor set characterizations of efficient faces in multiple objective linear programming., Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples, Equivalent weights for lexicographic multi-objective programs: Characterizations and computations, Bicriteria network flow problems: Continuous case, Optimization over the efficient set, A new method for determining all maximal efficient faces in multiple objective linear programming, A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone, Efficient solutions for the bicriteria network flow problem, A parametric simplex algorithm for linear vector optimization problems, A modified method for constructing efficient solutions structure of MOLP, The range of the efficient frontier in multiple objective linear programming, Constructing efficient solutions structure of multiobjective linear programming, Multiple objective programming with piecewise linear functions, An approach for finding efficient points in multiobjective linear programming, Biobjective optimization over the efficient set of multiobjective integer programming problem, Redundant objective functions in linear vector maximum problems and their determination, A general method for determining the set of all efficient solutions to a linear vectormaximum problem, Optimization over the efficient set using an active constraint approach, Finding all efficient extreme points for multiple objective linear programs, Solving multiple objective linear programs in objective space, Further analysis of an outcome set-based algorithm for multiple-objective linear programming, Hybrid approach for solving multiple-objective linear programs in outcome space, Determining maximal efficient faces in multiobjective linear programming problem, A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs, Approximating the noninferior set in linear biobjective programs using multiparametric decomposition, The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs, Solving zero-one multiple objective programs through implicit enumeration, Optimization over the efficient set of a parametric multiple objective linear programming problem, Vector linear programming in zero-sum multicriteria matrix games, An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming, Outcome space partition of the weight set in multiobjective linear programming, Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem, A graphical subroutine for multiobjective linear programming, On the structure of the set bases of a degenerate point, New closedness results for efficient sets in multiple objective mathematical programming, Approximating the noninferior set in multiobjective linear programming problems, The maximal descriptor index set for a face of a convex polyhedral set and some applications, A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program, Finding all maximal efficient faces in multiobjective linear programming, On efficient sets in vector maximum problems - A brief survey, An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors, Determination of the efficient set in multiobjective linear programming, Optimization over the efficient set: Four special cases, Stability in vector maximization - a survey, Analysis of multicriteria decision aid in Europe
Cites Work
- Unnamed Item
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
