The set of all nondominated solutions in linear cases and a multicriteria simplex method

DOI10.1016/0022-247X(75)90189-4zbMath0313.65047OpenAlexW1999486572WikidataQ56454542 ScholiaQ56454542MaRDI QIDQ1220359

S. Singh

Publication date: 1975

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(75)90189-4

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (only showing first 100 items - show all)

Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems ⋮ An algorithm for optimizing over the weakly-efficient set ⋮ TOPSIS for MODM ⋮ SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Optimizing a linear function over an efficient set ⋮ Random problem genertion and the computation of efficient extreme points in multiple objective linear programming ⋮ Some hybrid fixed point theorems related to optimization ⋮ A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions ⋮ Cone extreme points and faces ⋮ Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ A graph-based algorithm for the multi-objective optimization of gene regulatory networks ⋮ Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ TOPSIS for bi-level MODM problems ⋮ A binary integer linear program with multi-criteria and multi-constraint levels ⋮ Solution of multicriteria control problems in certain types of linear distributed-parameter systems by a multicriteria simplex method ⋮ Finding DEA-efficient hyperplanes using MOLP efficient faces ⋮ A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program ⋮ Stability in multicriteria optimization ⋮ Proper efficiency and cardinal utilities in multicriteria decision making ⋮ Linear programming with partial information ⋮ Duality for nonlinear multiple-criteria optimization problems ⋮ Bicriteria linear fractional programming ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions ⋮ Multicriteria analysis: Survey and new directions ⋮ Relaxation analysis in linear vectorvalued maximization ⋮ Linear programming with multiple fuzzy goals ⋮ Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. ⋮ A volume flexible economic production lot-sizing problem with imperfect quality and random machine failure in fuzzy-stochastic environment ⋮ Admissible points of a convex polyhedron ⋮ Multicriteria dynamic programming with an application to the integer case ⋮ An algorithm for the multiple objective integer linear programming problem ⋮ On a domination property for vector maximization with respect to cones ⋮ Conflict dissolution by reframing game payoffs using linear perturbations ⋮ Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ Equivalent weights for lexicographic multi-objective programs: Characterizations and computations ⋮ Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives ⋮ About Isermann duality ⋮ Characterizing coherence, correcting incoherence ⋮ Bicriteria network flow problems: Continuous case ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Multiple-objective programming with polynomial objectives and constraints ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ Weak duality theorem and complementary slackness theorem for linear matrix programming problems ⋮ Road to robust prediction of choices in deterministic MCDM ⋮ Total unimodularity applications in bi-objective discrete optimization ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ Sensitivity analysis in MCDM using the weight space ⋮ Efficient solutions for the bicriteria network flow problem ⋮ Constructing a Pareto front approximation for decision making ⋮ A modified method for constructing efficient solutions structure of MOLP ⋮ Extensions of TOPSIS for multi-objective large-scale nonlinear programming problems ⋮ A method for constructing the polar cone of a polyhedral cone, with applications to linear multicriteria decision problems ⋮ A regression study of the number of efficient extreme points in multiple objective linear programming ⋮ A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem ⋮ Constructing efficient solutions structure of multiobjective linear programming ⋮ An approximate solution of linear multicriteria control problems through the multicriteria simplex method ⋮ Vector maximization with two objective functions ⋮ A modified TOPSIS method based on \(D\) numbers and its applications in human resources selection ⋮ Necessary and sufficient conditions for local and global nondominated solutions in decision problems with multi-objectives ⋮ The structure of admissible points with respect to cone dominance ⋮ Generating all maximal efficient faces for multiple objective linear programs ⋮ Domination structures and multicriteria problems in N-person games ⋮ A semidefinite programming approach for solving multiobjective linear programming ⋮ A transportation model with multiple criteria and multiple constraint levels ⋮ Computational approach to essential and nonessential objective functions in linear multicriteria optimization ⋮ 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 ⋮ A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs ⋮ Potential solutions of linear systems: the multi-criteria multiple constraint levels program ⋮ A compromise procedure for the multiple objective linear fractional programming problem ⋮ Connectedness of efficient solutions in multiple criteria combinatorial optimization ⋮ Approximating the noninferior set in linear biobjective programs using multiparametric decomposition ⋮ Optimization over the efficient set of a parametric multiple objective linear programming problem ⋮ Optimal system design with MC\(^2\) linear programming: A dual contingency plan approach ⋮ A graphical subroutine for multiobjective linear programming ⋮ 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 ⋮ Careful usage of pessimistic values is needed in multiple objectives optimization ⋮ An \(\text{MC}^2\) linear programming approach to combined forecasting ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ Finding all maximal efficient faces in multiobjective linear programming ⋮ On efficient sets in vector maximum problems - A brief survey ⋮ An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors ⋮ A parametric approach to solving bicriterion shortest path problems ⋮ 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 ⋮ The compromise hypersphere for multiobjective linear programming ⋮ Stability in vector maximization - a survey ⋮ Analysis of multicriteria decision aid in Europe

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear multiobjective programming
• Control space properties of cooperative games
• A note on control space properties of cooperative games
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Linear Multiparametric Programming by Multicriteria Simplex Method
• Some New Results on Compromise Solutions for Group Decision Problems
• Strictly Concave Parametric Programming, Part II: Additional Theory and Computational Considerations
• Solving Bicriterion Mathematical Programs
• Multiparametric Linear Programming

This page was built for publication: The set of all nondominated solutions in linear cases and a multicriteria simplex method