Finding all efficient extreme points for multiple objective linear programs
From MaRDI portal
Publication:4166598
DOI10.1007/BF01588968zbMath0385.90105OpenAlexW1991794409MaRDI QIDQ4166598
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588968
Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Enumeration in graph theory (05C30)
Related Items
An algorithm for optimizing over the weakly-efficient set, Multiobjective flow control in delay constrained telecommunication networks, Optimizing a linear function over an efficient set, 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, A discussion of scalarization techniques for multiple objective integer programming, Bilevel programming for generating discrete representations in multiobjective optimization, SOLVING A SPECIAL CLASS OF MULTIPLE OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS, A bookkeeping strategy for multiple objective linear programs, Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software, 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, A multicriteria approach to the location of public facilities, Application of primitive sets to multi-criteria optimization problems, Multiobjective integer nonlinear fractional programming problem: a cutting plane approach, 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, Retrieval and use of the balance set in multiobjective global optimization, Equivalent weights for lexicographic multi-objective programs: Characterizations and computations, Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems., A new algorithm for linear multiobjective programming problems with bounded variables, 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, Generation of efficient and ε -efficient solutions in multiple objective linear programming, A simplified MOLP algorithm: The MOLP-S procedure, Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming, Optimization over the efficient set, A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone, Multiple-objective programming with polynomial objectives and constraints, On Benson's scalarization in multiobjective optimization, Pseudolinearity and efficiency, Linear complementarity problems and multiple objective programming, Minimization of a quasi-concave function over an efficient set, Efficient solutions for the bicriteria network flow problem, A parametric simplex algorithm for linear vector optimization problems, Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors., Uniform convergence and Pareto optimality, A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case, Optimization over the efficient set, 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, Testing for complete efficiency in a vector maximization problem, Efficiency in multiple objective optimization problems, A regression study of the number of efficient extreme points in multiple objective linear programming, Theory and algorithms for linear multiple objective programs with zero–one variables, Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization, A graphical characterization of the efficient set for convex multiobjective problems, An approach for finding efficient points in multiobjective linear programming, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, Biobjective optimization over the efficient set of multiobjective integer programming problem, A general method for determining the set of all efficient solutions to a linear vectormaximum problem, Finding all efficient extreme points for multiple objective linear programs, Solution of the linear inverse vector optimization problem by a single linear program, Generating all maximal efficient faces for multiple objective linear programs, A characterization of weakly efficient points, Solving bilevel linear programs using multiple objective linear programming, 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, Potential solutions of linear systems: the multi-criteria multiple constraint levels program, An Algorithm For Solving Multiple Objective Integer Linear Programming Problem, Goal programming sensitivity analysis using interval penalty weights, 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, An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming, Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization, Efficiency and proper efficiency in vector maximization with respect to cones, Fuzzy approaches for multiple objective linear fractional optimization, The maximal descriptor index set for a face of a convex polyhedral set and some applications, Finding all maximal efficient faces in multiobjective linear programming, On efficient sets in vector maximum problems - A brief survey, Enumerating extreme points of a highly degenerate polytope, Determination of the efficient set in multiobjective linear programming, Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities, A cutting plane approach for multi-objective integer indefinite quadratic programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Generating all maximal efficient faces for multiple objective linear programs
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- 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
- Technical note on duality in linear vector maximization
- Linear programming with multiple objective functions: Step method (stem)
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- Problems and methods with multiple objective functions
- An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
