Solving multiobjective programming problems by discrete representation

DOI10.1080/02331938908843466MaRDI QIDQ3833877zbMATH OpenOpenAlexFDO

Authors 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

multiobjective programmingvector optimizationPareto-set

Mathematics Subject Classification ID

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

Recommendations

• On the quality of discrete representations in multiple objective programming
• A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
• scientific article; zbMATH DE number 500505
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs

Cites work

• scientific article; zbMATH DE number 3934760 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• A multicriteria fuzzy linear programming method for water supply system development planning
• \(\epsilon\)-solutions in vector minimization problems

Cited in

(16)

• A new method for finding major efficient solutions and major optimal solutions of discrete multiobjective programming.
• scientific article; zbMATH DE number 4031423 (Why is no real title available?)
• A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
• scientific article; zbMATH DE number 1071795 (Why is no real title available?)
• Solving a multiresponse simulation-optimization problem with discrete variables using a multiple-attribute decision-making method
• Bicriteria integer quadratic programming problems
• scientific article; zbMATH DE number 500505 (Why is no real title available?)
• scientific article; zbMATH DE number 1462979 (Why is no real title available?)
• On the representation of the non-dominated set of multiobjective optimization problems
• Hybrid approach for solving multiple-objective linear programs in outcome space
• On the quality of discrete representations in multiple objective programming
• Generating equidistant representations in biobjective programming
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
• An algorithm for solving a class of discrete multicriterion problems
• Approximation methods in multiobjective programming
• Generating representative sets for multiobjective discrete optimization problems with specified coverage errors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833877)