The Linear Piecewise Lexicographic Programming (LPWLGP) problem is a mathematical programming model with linear constraints and several piecewise linear objective functions, arranged in a lexicographic hierarchy. Lexicographic spaces are introduced, and the differential properties of functions taking values in them are discussed. Necessary and sufficient optimality conditions for the LPWLGP problem are derived, and an algorithm based on them is formulated.
Titolo: | An Algorithm for Linearly Constrained Piecewise Lexicographic Programming Problems |
Autori: | |
Data di pubblicazione: | 2001 |
Rivista: | |
Abstract: | The Linear Piecewise Lexicographic Programming (LPWLGP) problem is a mathematical programming model with linear constraints and several piecewise linear objective functions, arranged in a lexicographic hierarchy. Lexicographic spaces are introduced, and the differential properties of functions taking values in them are discussed. Necessary and sufficient optimality conditions for the LPWLGP problem are derived, and an algorithm based on them is formulated. |
Handle: | http://hdl.handle.net/11368/1699328 |
Appare nelle tipologie: | 1.1 Articolo in Rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.