Identifying Efficient Vectors: Some Theory and Computational Results
From MaRDI portal
Publication:3890439
DOI10.1287/opre.28.3.785zbMath0445.90079OpenAlexW2127347544MaRDI QIDQ3890439
Jyrki Wallenius, Stanley Zionts
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.3.785
multiple criteria decision makingsimplex methodvector algebraidentification of redundant constraintsconvex nondominated vector problemefficient tradeoff vectorsefficient vectorextreme vector problem
Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items
A class of practical interactive branch and bound algorithms for multicriteria integer programming, An approach for preference ranking of alternatives, Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study, A comparative multiobjective programming study, An interactive MOLP procedure using epsilon-constraints, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, Interactive multiobjective optimization approach to the input-output design of opening new branches, Interactive algorithms for a broad underlying family of preference functions, A new exact method for linear bilevel problems with multiple objective functions at the lower level, Linear multicriteria sensitivity and shadow costs, A multiple criteria method for choosing among discrete alternatives, Network reoptimization procedures for multiobjective network problems, The multiscenario lot size problem with concave costs., Applications of the parametric programming procedure, Nonlinear multiple objective optimization: An algorithm and some theory, A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone, A computer graphics-based decision support system for multiple objective linear programming, A parametric simplex algorithm for linear vector 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, Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations, An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria, Interactive multiple objective optimization: Survey. I: Continuous case, An exact method for computing the nadir values in multiple objective linear programming, A study of high-level managerial decision processes, with implications for MCDM research, Outcome space partition of the weight set in multiobjective linear programming, An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors, Determination of the efficient set in multiobjective linear programming, Multiobjective solution of the uncapacitated plant location problem
