Multiple Objective Linear Programming with Interval Criterion Weights

DOI10.1287/mnsc.23.3.305zbMath0437.90086OpenAlexW2079633785MaRDI QIDQ3879072

Ralph B. Steuer

Publication date: 1976

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.3.305

zbMATH Keywords

algorithmvector optimizationdecision makingcomputational experienceinterval weightsmultiple objective linear programming problemscluster of efficient extreme pointsequivalent vector-maximum problempoint of greatest utility

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (39)

Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems ⋮ Multiobjective mathematical programming via the MULTIPLEX model and algorithm ⋮ An algorithm for optimizing over the weakly-efficient set ⋮ Interactive algorithms for multiple criteria nonlinear programming problems ⋮ A simplified interactive multiple objective linear programming procedure ⋮ A comparison of interactive multiple-objective decision making procedures ⋮ Random problem genertion and the computation of efficient extreme points in multiple objective linear programming ⋮ A new method for elicitation of criteria weights in additive models: flexible and interactive tradeoff ⋮ Supporting complex group decisions: A probabilistic multi-dimensional scaling approach ⋮ Stable solutions for multiple scenario cost allocation games with partial information ⋮ A multicriteria approach to the location of public facilities ⋮ A flexible elicitation procedure for additive model scale constants ⋮ An algorithm for bicriterion linear programming ⋮ Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems ⋮ Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems. ⋮ Bicriteria network flow problems: Continuous case ⋮ A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone ⋮ Implementation of the centroid method of Solymosi and Dombi ⋮ VMDP-program for solving optimality problems in vector criterion Markov and semi-Markov decision processes ⋮ Sequential incorporation of imprecise information in multiple criteria decision processes ⋮ Core solutions in vector-valued games ⋮ Tchebycheff norms in multi-objective linear programming ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ Interactive multiple objective optimization: Survey. I: Continuous case ⋮ Dominance in spatial voting with imprecise ideals ⋮ Sensitivity analysis in multiple objective linear programming: The tolerance approach ⋮ Goal programming sensitivity analysis using interval penalty weights ⋮ Approximating the noninferior set in linear biobjective programs using multiparametric decomposition ⋮ A flexible approach to ranking with an application to MBA programs ⋮ Linear programming in tector criterion markov and semi-Markov decision processes ⋮ Analysis of multiobjective decision problems by the indifference band approach ⋮ Selecting tolerances in chance-constrained programming: A multiple objective linear programming approach ⋮ An interactive graphic presentation for multiobjective linear programming. ⋮ An interactive decision framework for multiple objective production planning ⋮ Approximating the noninferior set in multiobjective linear programming problems ⋮ The regional urban solid waste management system: A modelling approach ⋮ A visual interactive method for solving the multiple criteria problem ⋮ Stability in vector maximization - a survey ⋮ A long range forestry planning problem with multiple objectives

This page was built for publication: Multiple Objective Linear Programming with Interval Criterion Weights