A Relationship between optimality and efficiency in multicriteria 0-1 programming problems

@article{Burkard1981ARB,
  title={A Relationship between optimality and efficiency in multicriteria 0-1 programming problems},
  author={Rainer E. Burkard and Hans Keiding and Peter M. Pruzan and Jakob Krarup},
  journal={Comput. Oper. Res.},
  year={1981},
  volume={8},
  pages={241-247}
}

Figures from this paper

Conditions of the efficiency of a solution of a discrete vector optimization problem
For some classes of multicriteria problems with a finite set of vector valuations, necessary and sufficient conditions of the Pareto-optimality of the solution in terms of a sum of modified criteria
Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives
Relations between efficient solutions to discrete multicriteria decision problems and optimal solutions to corresponding parametric single-criterion problems are analyzed. In particular we consider
Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
TLDR
Property of efficient and optimal solutions to two-criteria 0-1 programming problems with any constraint set are considered and a solution procedure is suggested for solving problems whose objective functions are a convex combination of these criteria.
Complexity of discrete multicriteria problems
This review contains the results which concern the estimates of the computational complexity of combinatorial problems of vector optimization, the solvability of these problems in the class of
Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem
TLDR
A new framework for identifying preferred solutions to multi-objective binary optimisation problems is presented and the necessary theory which leads to new formulations that integrate the decision space with the space of criterion weights is developed.
Solvability of the vector problem by the linear criteria convolution algorithm
Conditions are found under which a multicriteria problem with a finite set of vector estimates is solvable by means of the linear criteria convolution (LCC) algorithm, that is, any Pareto optimum for
Multi‐objective combinatorial optimization problems: A survey
TLDR
The present paper is intended to review the existing literature on multi-objective combinatorial optimization (MOCO) problems and examines various classical combinatorials problems in a multi-criteria framework.
Pareto-optimality conditions in discrete vector optimization problems
For the vector optimization problem /(*)-> min V i € Nn = {1,2,...,«}, with a finite set of vector estimators F(X) we give a wide class of efficiency (Pareto-optimality) criteria in terms of linear
...
...

References

SHOWING 1-3 OF 3 REFERENCES
Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
TLDR
Property of efficient and optimal solutions to two-criteria 0-1 programming problems with any constraint set are considered and a solution procedure is suggested for solving problems whose objective functions are a convex combination of these criteria.