𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lexicographic optima in the multicriteria discrete optimization problem

✍ Scribed by V. A. Emelichev; M. K. Kravtsov; O. A. Yanushkevich

Publisher
SP MAIK Nauka/Interperiodica
Year
1995
Tongue
English
Weight
248 KB
Volume
58
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Structure of efficient sets in lexicogra
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
✍ Nicolae Popovici πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 188 KB

The aim of this paper is to emphasize some remarkable properties of multicriteria optimization problems involving lexicographic quasiconvex objective functions. It is shown that, under appropriate assumptions, these problems are Pareto reducible and their efficient sets are strongly contractible.

Partial polyhedral description and gener
Partial polyhedral description and generation of discrete optimization problems with known optima
✍ Martha G. Pilcher; Ronald L. Rardin πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 942 KB

We detail a random cut concept for generating instances of discrete optimization problems based on a partial description of the polytope of solutions. We show how implementations of this approach have the useful properties that an optimal solution and the form of valid equalities required to solve t