The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program

Cited In (80)

Decision space robustness for multi-objective integer linear programming
Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
Solving a special class of multiple objective linear fractional programming problems
Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage
Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level
Applications of the parametric programming procedure
Title not available (Why is that?)
Inverse DEA under inter-temporal dependence using multiple-objective programming
A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
Connectedness of efficient solutions in multiple objective combinatorial optimization
A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
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 matroids with multiple objectives
On efficient sets in vector maximum problems - A brief survey
Goal programming with linear fractional criteria
MOLP with an interactive assessment of a piecewise linear utility function
A regression study of the number of efficient extreme points in multiple objective linear programming
An exact penalty on bilevel programs with linear vector optimization lower level
Stability in vector maximization - a survey
Connectedness of efficient solutions in multiple criteria combinatorial optimization
Efficient solution generation for multiple objective linear programming based on extreme ray generation method
Duality for nonlinear multiple-criteria optimization problems
Efficient solutions for the bicriteria network flow problem
The attainment of the solution of the dual program in vertices for vectorial linear programs
Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
A linear bilevel programming algorithm based on bicriteria programming
Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
The maximal descriptor index set for a face of a convex polyhedral set and some applications
Multiobjective solution of the uncapacitated plant location problem
Optimization over the efficient set
An algorithm for optimizing over the weakly-efficient set
Approximating the noninferior set in multiobjective linear programming problems
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
An exact algorithm for biobjective mixed integer linear programming problems
A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
A new exact method for linear bilevel problems with multiple objective functions at the lower level
An algorithm for bicriterion linear programming
Generation of some methods for solving interval multi-objective linear programming models
Approximate quasi solutions of multiobjective optimization problems
Zielgewichtungskompromisse für lineare Programme mit mehrfacher Zielsetzung
A common formula to compute the efficient sets of a class of multiple objective linear programming problems
Hybrid approach for solving multiple-objective linear programs in outcome space
A reduction algorithm for integer multiple objective linear programs
Computational experience concerning payoff tables and minimum criterion values over the efficient set
The range of the efficient frontier in multiple objective linear programming
On the computation of all supported efficient solutions in multi-objective integer network flow problems
Characterizing coherence, correcting incoherence
A compromise procedure for the multiple objective linear fractional programming problem
Bicriteria linear fractional programming
Multiple objective programming with piecewise linear functions
Adjacency based method for generating maximal efficient faces in multiobjective linear programming
Vector linear programming in zero-sum multicriteria matrix games
A restricted class of multiobjective linear fractional programming problems
Constructing efficient solutions structure of multiobjective linear programming
An approach for finding efficient points in multiobjective linear programming
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 branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
A general method for determining the set of all efficient solutions to a linear vectormaximum problem
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
Finding all maximal efficient faces in multiobjective linear programming
Determination of the efficient set in multiobjective linear programming
A graphical subroutine for multiobjective linear programming
Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
A criterion space search algorithm for biobjective integer programming: the balanced box method
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
Primal-dual simplex method for multiobjective linear programming
Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung
A parametric simplex algorithm for linear vector optimization problems

This page was built for publication: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program

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