Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming

DOI10.1137/0319030zbMath0457.90072OpenAlexW1982599315MaRDI QIDQ3907427

J. G. Ecker, Nancy E. Shoemaker

Publication date: 1981

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0319030

zbMATH Keywords

nondominated pointsmultiple objective linear programmingselection of subsetstrade-off compromise set

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

A comparison of interactive multiple-objective decision making procedures, Minmax combinatorial optimization, Saddle points and scalarizing sets in multiple objective linear programming, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, An interactive weighted Tchebycheff procedure for multiple objective programming, Finding all maximal efficient faces in multiobjective linear programming, Determination of the efficient set in multiobjective linear programming