Finding all efficient extreme points for multiple objective linear programs

Cites work

A revised simplex method for linear multiple objective programs
Algorithms for the vector maximization problem
An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
An Interactive Programming Method for Solving the Multiple Criteria Problem
Finding all efficient extreme points for multiple objective linear programs
Generating all maximal efficient faces for multiple objective linear programs
scientific article; zbMATH DE number 3175708 (Why is no real title available?)
scientific article; zbMATH DE number 3069611 (Why is no real title available?)
Linear programming with multiple objective functions: Step method (stem)
Problems and methods with multiple objective functions
Technical note on duality in linear vector maximization
The set of all nondominated solutions in linear cases and a multicriteria simplex method

Cited in

(84)

Solving bilevel linear programs using multiple objective linear programming
Determining maximal efficient faces in multiobjective linear programming problem
Efficiency and proper efficiency in vector maximization with respect to cones
On efficient sets in vector maximum problems - A brief survey
An algorithm for optimizing over the weakly-efficient set
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
Distributional efficiency in multiobjective stochastic linear programming
A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
A multicriteria approach to the location of public facilities
Application of primitive sets to multi-criteria optimization problems
Relaxation analysis in linear vectorvalued maximization
Linear programming with multiple fuzzy goals
Admissible points of a convex polyhedron
An algorithm for the multiple objective integer linear programming problem
An algorithm for bicriterion linear programming
Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
Bicriteria network flow problems: Continuous case
Transformation and restructuring of linear multiobjective programs: A fundamental method to resolve complex problems
Applications of the parametric programming procedure
A simplified MOLP algorithm: The MOLP-S procedure
Multiple-objective programming with polynomial objectives and constraints
Efficient solutions for the bicriteria network flow problem
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
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
Further analysis of an outcome set-based algorithm for multiple-objective linear programming
Hybrid approach for solving multiple-objective linear programs in outcome space
Finding all maximal efficient faces in multiobjective linear programming
Enumerating extreme points of a highly degenerate polytope
Determination of the efficient set in multiobjective linear programming
Multiobjective flow control in delay constrained telecommunication networks
Optimizing a linear function over an efficient set
A bookkeeping strategy for multiple objective linear programs
Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems.
Optimization over the efficient set of a parametric multiple objective linear programming problem
Bilevel programming for generating discrete representations in multiobjective optimization
Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
Balance set and Pareto solutions in linear space with application to ongoing optimal resource allocation, investment planning, production, and control problems with multiple objectives
Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons
A characterization of weakly efficient points
Solving zero-one multiple objective programs through implicit enumeration
Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
Retrieval and use of the balance set in multiobjective global optimization
Biobjective optimization over the efficient set of multiobjective integer programming problem
Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities
A graphical characterization of the efficient set for convex multiobjective problems
Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
The maximal descriptor index set for a face of a convex polyhedral set and some applications
A discussion of scalarization techniques for multiple objective integer programming
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
A cutting plane approach for multi-objective integer indefinite quadratic programming problem
Solving a special class of multiple objective linear fractional programming problems
Uniform convergence and Pareto optimality
Pseudolinearity and efficiency
An approach for finding efficient points in multiobjective linear programming
The attainment of the solution of the dual program in vertices for vectorial linear programs
Theory and algorithms for linear multiple objective programs with zero–one variables
Testing for complete efficiency in a vector maximization problem
Efficiency in multiple objective optimization problems
Finding all efficient extreme points for multiple objective linear programs
Solution of the linear inverse vector optimization problem by a single linear program
Goal programming sensitivity analysis using interval penalty weights
An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
Generation of efficient and ε -efficient solutions in multiple objective linear programming
A new algorithm for linear multiobjective programming problems with bounded variables
On Benson's scalarization in multiobjective optimization
A parametric simplex algorithm for linear vector optimization problems
Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
Optimization over the efficient set
Optimization over the efficient set
Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software
Efficient curve fitting: an application of multiobjective programming
A linearized approach for solving differentiable vector optimization problems with vanishing constraints
A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
Linear complementarity problems and multiple objective programming
Minimization of a quasi-concave function over an efficient set
A regression study of the number of efficient extreme points in multiple objective linear programming
Solving multiple objective linear programs in objective space
Potential solutions of linear systems: the multi-criteria multiple constraint levels program
Fuzzy approaches for multiple objective linear fractional optimization

This page was built for publication: Finding all efficient extreme points for multiple objective linear programs

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