A general method for determining the set of all efficient solutions to a linear vectormaximum problem
From MaRDI portal
Publication:1245073
DOI10.1016/0377-2217(77)90063-7zbMATH Open0374.90044OpenAlexW1972695578MaRDI QIDQ1245073FDOQ1245073
Publication date: 1977
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(77)90063-7
Cites Work
- Title not available (Why is that?)
- Proper efficiency and the theory of vector maximization
- 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
- Linear multiobjective programming
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- Generating all maximal efficient faces for multiple objective linear programs
- Vektormaximumproblem und parametrische optimierung
- Sensitivitätsanalysen und parametrische Programmierung
- Multiparametric Linear Programming
- Relaxation analysis in linear vectorvalued maximization
- Homogene mehrparametrische lineare Programmierung
- Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
Cited In (65)
- 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
- Fuzzy potential solutions in multi-criteria and multi-constraint level linear programming problems
- 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
- Uniform convergence and Pareto optimality
- On efficient sets in vector maximum problems - A brief survey
- Approaches to sensitivity analysis in linear programming
- 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
- 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 maximal descriptor index set for a face of a convex polyhedral set and some applications
- Optimization over the efficient set
- An algorithm for optimizing over the weakly-efficient set
- Approximating the noninferior set in multiobjective linear programming problems
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- An algorithm for bicriterion linear programming
- 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
- Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- 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
- A compromise procedure for the multiple objective linear fractional programming problem
- Bicriteria linear fractional programming
- Applications of the parametric programming procedure
- 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
- Selected bibliography on degeneracy
- Analysis of multicriteria decision aid in Europe
- 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
- A simplified MOLP algorithm: The MOLP-S procedure
- On the convergence of multiobjective evolutionary algorithms
- On the structure of the set bases of a degenerate point
- A binary integer linear program with multi-criteria and multi-constraint levels
- 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
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Outcome space partition of the weight set in multiobjective linear programming
- Multiobjective mathematical programming via the MULTIPLEX model and algorithm
- A new method for determining all maximal efficient faces in multiple objective linear programming
- Multi-objective modeling for engineering applications: DIDASN++ system
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung
- An algorithm for systems welfare interactive goal programming modelling
- Solving discrete multiobjective optimization problems based on approximation.
- Solving a special class of multiple objective linear fractional programming problems
- Discussion and modification of the Fandel-method solving linear vector maximum problems
- 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
- A transportation model with multiple criteria and multiple constraint levels
This page was built for publication: A general method for determining the set of all efficient solutions to a linear vectormaximum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245073)
