Linear Multiparametric Programming by Multicriteria Simplex Method
From MaRDI portal
Publication:4133401
DOI10.1287/mnsc.23.2.159zbMath0357.90034OpenAlexW2164555593MaRDI QIDQ4133401
No author found.
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.23.2.159
Related Items
Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems, Interactive solutions for the linear multiobjective transportation problem, MOLP with an interactive assessment of a piecewise linear utility function, Heuristic approaches for biobjective mixed 0-1 integer linear programming problems, Graphical exploration of the weight space in three-objective mixed integer linear programs, An exact algorithm for biobjective mixed integer linear programming problems, Minimax regret solution to linear programming problems with an interval objective function, Using DEA factor efficiency scores to eliminate subjectivity in goal programming, Inverse linear programming with interval coefficients, Total unimodularity applications in bi-objective discrete optimization, Sensitivity analysis in MCDM using the weight space, Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis, The set of all nondominated solutions in linear cases and a multicriteria simplex method, The exact solution of multiparametric quadratically constrained quadratic programming problems, Programacion Multiobjetivo, Potential solutions of linear systems: the multi-criteria multiple constraint levels program, Approximating the noninferior set in linear biobjective programs using multiparametric decomposition, The biobjective minimum cost flow problem, Vector linear programming in zero-sum multicriteria matrix games, A graphical subroutine for multiobjective linear programming, On the structure of the set bases of a degenerate point, A multi-objective transportation problem under fuzziness, A parametric approach to solving bicriterion shortest path problems
