scientific article; zbMATH DE number 3887462
[For the entire collection see Zbl 0528.00011.] After introducing the standard multicriteria optimization problem and defining the efficient set a selective review of algorithms available for determining either the whole set of efficient solutions or some well- defined subset, or, in one case, a close approximation to the efficient set - is undertaken. The algorithms are partitioned into 3 classes: (I) A characterisation of efficiency is used to transform the multiple objective problem into a family of single objective problems specified in terms of a number (usually p-1), of parameters. (II) A standard single objective optimisation method is modified to cope with multiple objective problems. (III) The final class contains all methods which do not correspond to any standard single objective method. Another possible classification is by the manner in which they construct the efficient set: (A) Each iteration generates a subset of the efficient set (or whatever set we are aiming to find). The union of the subsets is the efficient set. (B) At each iteration there is a set containing the efficient set. The intersection of these sets is the efficient set. (C) The penultimate stage of the algorithm is a set S of feasible solutions containing the efficient set, and the final step is to find the efficient subset of S which is obviously the efficient set. (D) Other methods. According to this classification, algorithms for solving MOLP, sequential problems via dynamic programming, integer problems and routing and assignment problems are surveyed. Nonlinear problems involving more sophisticated characterization theorems and the few algorithms are not discussed in the paper.
- A new algorithm for vector optimization problem
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- On an algorithm for solving a linear vector optimization problem
- Optimization over the efficient set: overview
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine
- Finding all maximal efficient faces in multiobjective linear programming
- The compromise hypersphere for multiobjective linear programming
- scientific article; zbMATH DE number 4130196 (Why is no real title available?)
- scientific article; zbMATH DE number 992921 (Why is no real title available?)
- scientific article; zbMATH DE number 4137549 (Why is no real title available?)
- scientific article; zbMATH DE number 3989095 (Why is no real title available?)
- A new algorithm for vector optimization problem
- scientific article; zbMATH DE number 1234735 (Why is no real title available?)
- Survey on vector complementarity problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221979)