Relaxation analysis in linear vectorvalued maximization

DOI10.1016/0377-2217(81)90176-4zbMath0464.90069OpenAlexW2047394055MaRDI QIDQ1154395

Heiner Leberling, Tomas Gal

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90176-4

zbMATH Keywords

undirected graphadmissible parameterslinear vectorvalued maximizationpostefficient sensitivity analysisrelaxation analysis

Mathematics Subject Classification ID

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

Related Items

Sensitivity analysis in MCDM using the weight space, A general method for determining the set of all efficient solutions to a linear vectormaximum problem, On efficient sets in vector maximum problems - A brief survey, Stability in vector maximization - a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Multiple criteria decision making. Proceedings of a conference, Jouy-en- Josas, France, May 21-23, 1975
• Linear multiobjective programming
• Redundant objective functions in linear vector maximum problems and their determination
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Generating all maximal efficient faces for multiple objective linear programs
• Proper efficiency and the theory of vector maximization
• Optimale Entscheidung bei mehrfacher Zielsetzung
• Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
• Finding all efficient extreme points for multiple objective linear programs
• Vektormaximumproblem und parametrische optimierung
• A revised simplex method for linear multiple objective programs
• Sensitivitätsanalysen und parametrische Programmierung