The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
From MaRDI portal
Publication:4149221
DOI10.1057/jors.1977.147zbMath0372.90086OpenAlexW2082396019MaRDI QIDQ4149221
Publication date: 1977
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1977.147
Related Items
An algorithm for optimizing over the weakly-efficient set, Efficient solution generation for multiple objective linear programming based on extreme ray generation method, Random problem genertion and the computation of efficient extreme points in multiple objective linear programming, Inverse DEA under inter-temporal dependence using multiple-objective programming, Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives, Computational experience concerning payoff tables and minimum criterion values over the efficient set, A common formula to compute the efficient sets of a class of multiple objective linear programming problems, MOLP with an interactive assessment of a piecewise linear utility function, Heuristic approaches for biobjective mixed 0-1 integer linear programming problems, Generation of some methods for solving interval multi-objective linear programming models, Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage, Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case, An exact algorithm for biobjective mixed integer linear programming problems, Unnamed Item, Adjacency based method for generating maximal efficient faces in multiobjective linear programming, SOLVING A SPECIAL CLASS OF MULTIPLE OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS, A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs, A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, A new exact method for linear bilevel problems with multiple objective functions at the lower level, Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung, Linear programming with partial information, Duality for nonlinear multiple-criteria optimization problems, Zielgewichtungskompromisse für lineare Programme mit mehrfacher Zielsetzung, Bicriteria linear fractional programming, Maximal descriptor set characterizations of efficient faces in multiple objective linear programming., An algorithm for bicriterion linear programming, Unnamed Item, Goal programming with linear fractional criteria, Connectedness of efficient solutions in multiple objective combinatorial optimization, A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming, Characterizing coherence, correcting incoherence, Applications of the parametric programming procedure, Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming, Optimization over the efficient set, Primal-dual simplex method for multiobjective linear programming, A new method for determining all maximal efficient faces in multiple objective linear programming, A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone, Efficient solutions for the bicriteria network flow problem, A parametric simplex algorithm for linear vector optimization problems, A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case, A modified method for constructing efficient solutions structure of MOLP, The range of the efficient frontier in multiple objective linear programming, A regression study of the number of efficient extreme points in multiple objective linear programming, Constructing efficient solutions structure of multiobjective linear programming, Multiple objective programming with piecewise linear functions, On matroids with multiple objectives, An approach for finding efficient points in multiobjective linear programming, A linear bilevel programming algorithm based on bicriteria programming, A general method for determining the set of all efficient solutions to a linear vectormaximum problem, A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method, A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method, Generating all maximal efficient faces for multiple objective linear programs, An exact penalty on bilevel programs with linear vector optimization lower level, Hybrid approach for solving multiple-objective linear programs in outcome space, Determining maximal efficient faces in multiobjective linear programming problem, A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs, 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, An Algorithm For Solving Multiple Objective Integer Linear Programming Problem, A compromise procedure for the multiple objective linear fractional programming problem, Connectedness of efficient solutions in multiple criteria combinatorial optimization, A reduction algorithm for integer multiple objective linear programs, The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs, Optimization over the efficient set of a parametric multiple objective linear programming problem, On the computation of all supported efficient solutions in multi-objective integer network flow problems, Vector linear programming in zero-sum multicriteria matrix games, Outcome space partition of the weight set in multiobjective linear programming, Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem, A graphical subroutine for multiobjective linear programming, On the structure of the set bases of a degenerate point, New closedness results for efficient sets in multiple objective mathematical programming, A restricted class of multiobjective linear fractional programming problems, Approximating the noninferior set in multiobjective linear programming problems, 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, Decision space robustness for multi-objective integer linear programming, On efficient sets in vector maximum problems - A brief survey, Determination of the efficient set in multiobjective linear programming, Multiobjective solution of the uncapacitated plant location problem, Stability in vector maximization - a survey
