The set of all nondominated solutions in linear cases and a multicriteria simplex method
From MaRDI portal
Publication:1220359
DOI10.1016/0022-247X(75)90189-4zbMath0313.65047WikidataQ56454542 ScholiaQ56454542MaRDI QIDQ1220359
Publication date: 1975
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, Bicriteria network flow problems: Continuous case, Multiple-objective programming with polynomial objectives and constraints, Weak duality theorem and complementary slackness theorem for linear matrix programming problems, Total unimodularity applications in bi-objective discrete optimization, Sensitivity analysis in MCDM using the weight space, Efficient solutions for the bicriteria network flow problem, Further analysis of an outcome set-based algorithm for multiple-objective linear programming, Hybrid approach for solving multiple-objective linear programs in outcome space, A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs, Connectedness of efficient solutions in multiple criteria combinatorial optimization, Optimal system design with MC\(^2\) linear programming: A dual contingency plan approach, 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, Duality theory for infinite-dimensional multiobjective linear programming, Finding all maximal efficient faces in multiobjective linear programming, An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors, Fuzzy potential solutions in multi-criteria and multi-constraint level linear programming problems, On the efficient point set of tricriteria linear programs, Determination of the efficient set in multiobjective linear programming, Nonscalarized multiobjective global optimization, Optimization over the efficient set: Four special cases, TOPSIS for MODM, Optimizing a linear function over an efficient set, Random problem genertion and the computation of efficient extreme points in multiple objective linear programming, A binary integer linear program with multi-criteria and multi-constraint levels, Proper efficiency and cardinal utilities in multicriteria decision making, Optimization over the efficient set of a parametric multiple objective linear programming problem, A transportation model with multiple criteria and multiple constraint levels, A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions, Vector linear programming in zero-sum multicriteria matrix games, An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming, Stability of the extreme point set of a polyhedron, Solving a linear multiperiod portfolio problem by interior-point methodology
