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: 
PASTORE, STEFANO
UKOVICH, WALTER
mostra contributor esterni 
Data di pubblicazione: 2001
Rivista: 
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS  
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.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/11368/1699328
  • Citazioni
  • ND
  • ND
  • ND

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
©2014 University of Trieste dove siamo Privacy
Piazzale Europa,1 34127 Trieste, Italia - Tel. +39 040.558.7111 - P.IVA 00211830328 - C.F. 80013890324 - P.E.C.: ateneo@pec.units.it
 Copyright © 2020