Logo del repository
  1. Home
 
Opzioni

An Algorithm for Linearly Constrained Piecewise Lexicographic Programming Problems

PASTORE, STEFANO
•
PREMOLI A.
•
UKOVICH, WALTER
2001
  • journal article

Periodico
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.
Archivio
http://hdl.handle.net/11368/1699328
Diritti
metadata only access
Soggetti
  • Multiobjective optimi...

  • lexicographic functio...

  • piecewise-linear prog...

Visualizzazioni
3
Data di acquisizione
Apr 19, 2024
Vedi dettagli
google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback