Generating all maximal efficient faces for multiple objective linear programs

Cites work

scientific article; zbMATH DE number 3552199 (Why is no real title available?)
A revised simplex method for linear multiple objective programs
Algorithms for the vector maximization problem
Finding all efficient extreme points for multiple objective linear programs
The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
The set of all nondominated solutions in linear cases and a multicriteria simplex method

Cited in

(64)

An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
Redundant objective functions in linear vector maximum problems and their determination
New closedness results for efficient sets in multiple objective mathematical programming
Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives
Linear programming with partial information
On efficient sets in vector maximum problems - A brief survey
Optimization over the efficient set using an active constraint approach
Stability in vector maximization - a survey
Bicriteria network flow problems: Continuous case
Efficient solutions for the bicriteria network flow problem
Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
Distributional efficiency in multiobjective stochastic linear programming
The attainment of the solution of the dual program in vertices for vectorial linear programs
The maximal descriptor index set for a face of a convex polyhedral set and some applications
Optimization over the efficient set: Four special cases
Optimizing a linear function over an efficient set
An algorithm for optimizing over the weakly-efficient set
Approximating the noninferior set in multiobjective linear programming problems
Optimization over the efficient set
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
Solving a special class of multiple objective linear fractional programming problems
A graph-based algorithm for the multi-objective optimization of gene regulatory networks
A common formula to compute the efficient sets of a class of multiple objective linear programming problems
Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors
Hybrid approach for solving multiple-objective linear programs in outcome space
Computational experience concerning payoff tables and minimum criterion values over the efficient set
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
The range of the efficient frontier in multiple objective linear programming
A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
Solving multiple objective linear programs in objective space
Bicriteria linear fractional programming
Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
A multiobjective based approach for mathematical programs with linear flexible constraints
Vector linear programming in zero-sum multicriteria matrix games
Multiple objective programming with piecewise linear functions
Analysis of multicriteria decision aid in Europe
Analysis of the objective space in multiple objective linear programming
Constructing efficient solutions structure of multiobjective linear programming
Efficient curve fitting: an application of multiobjective programming
An approach for finding efficient points in multiobjective linear programming
Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
A modified method for constructing efficient solutions structure of MOLP
Determining maximal efficient faces in multiobjective linear programming problem
On the structure of the set bases of a degenerate point
A general method for determining the set of all efficient solutions to a linear vectormaximum problem
A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
Further analysis of an outcome set-based algorithm for multiple-objective linear programming
Finding all maximal efficient faces in multiobjective linear programming
Relaxation analysis in linear vectorvalued maximization
Determination of the efficient set in multiobjective linear programming
A graphical subroutine for multiobjective linear programming
Finding all efficient extreme points for multiple objective linear programs
Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
Solving zero-one multiple objective programs through implicit enumeration
Optimization over the efficient set of a parametric multiple objective linear programming problem
Outcome space partition of the weight set in multiobjective linear programming
A new method for determining all maximal efficient faces in multiple objective linear programming
Biobjective optimization over the efficient set of multiobjective integer programming problem
A parametric simplex algorithm for linear vector optimization problems

This page was built for publication: Generating all maximal efficient faces for multiple objective linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252160)