Introducing oblique norms into multiple criteria programming (Q1598887)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Introducing oblique norms into multiple criteria programming |
scientific article; zbMATH DE number 1746312
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Introducing oblique norms into multiple criteria programming |
scientific article; zbMATH DE number 1746312 |
Statements
Introducing oblique norms into multiple criteria programming (English)
0 references
28 May 2002
0 references
Block norms, also referred as polyhedral norms, play an important role in the measurement of distance. In multiple criteria programming, norms have usually been used to identify the nondominated solutions that are the closest to some reference point. The definition of block norm and oblique norm as a specified block norm as well as two approaches to constructing oblique norm are given. In the paper the authors propose to use block norms to generate nondominated solutions of multiple criteria programs. The equivalence of finding the properly nondominated solutions of a mulliple criteria program and solving its scalarization by means of oblique norms is shown.
0 references
multiple criteria programming
0 references
block norms
0 references
properly nondominated solutions
0 references
oblique norms
0 references