Multiobjective Linear Programming

Mikuláš Luptáčik ()
Additional contact information
Mikuláš Luptáčik: Vienna University of Economics and Business Administration

Chapter 8 in Mathematical Optimization and Economic Analysis, 2010, pp 243-269 from Springer

Abstract: Abstract As in single-objective mathematical programming, the most developed part of multiobjective optimization—from the theoretical as well as the applications point of view—is multiobjective linear programming. In 1951, Gale, Kuhn, and Tucker [7] considered a pair of general matrix linear programming problems, i.e., a linear programming problem with a matrix–valued linear objective function, and established some theorems of existence and duality. With matrix linear programming problems containing linear programming problems with a vector—valued as well as a scalarvalued objective function as special cases, the developed theory comprises the respective theoretical framework for vector linear programming problems as well as for ordinary linear programming problems.

Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-89552-9_8

Ordering information: This item can be ordered from
http://www.springer.com/9780387895529

DOI: 10.1007/978-0-387-89552-9_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().