Solving multiobjective programming problems by discrete representation

DOI10.1080/02331938908843466zbMath0677.90066OpenAlexW2015423752MaRDI QIDQ3833877

Rüdiger Armann

Publication date: 1989

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938908843466

zbMATH Keywords

vector optimizationmultiobjective programmingPareto-set

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items (6)

On the quality of discrete representations in multiple objective programming ⋮ Generating equidistant representations in biobjective programming ⋮ Bicriteria integer quadratic programming problems ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ Approximation methods in multiobjective programming ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program

Cites Work

• A multicriteria fuzzy linear programming method for water supply system development planning
• \(\epsilon\)-solutions in vector minimization problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving multiobjective programming problems by discrete representation