An algorithm for linearly-constrained piecewise lexicographic programming problems.

DOI10.1023/A:1017583617249zbMath1051.90022OpenAlexW1565087508MaRDI QIDQ5958084

Walter Ukovich, Amedeo Premoli, Stefano Pastore

Publication date: 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017583617249

zbMATH Keywords

Multiobjective optimization, lexicographic functions, piecewise-linear programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

Application of convex lexicographical optimization to the balance of GRTgaz gas grid ⋮ An extension of the fundamental theorem of linear programming

Cites Work

• Unnamed Item
• A survey of vector optimization in infinite-dimensional spaces. II
• Multiobjective mathematical programming via the MULTIPLEX model and algorithm
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A lexicographic minimax algorithm for multiperiod resource allocation
• A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
• Piecewise lexicographic programming: A new model for practical decision problems
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Piecewise-linear programming: The compact (CPLP) algorithm
• Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
• Convex Analysis

This page was built for publication: An algorithm for linearly-constrained piecewise lexicographic programming problems.