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.
CITATION STYLE
Multiobjective linear programming. (2010). In Springer Optimization and Its Applications (Vol. 36, pp. 243–269). Springer International Publishing. https://doi.org/10.1007/978-0-387-89552-9_8
Mendeley helps you to discover research relevant for your work.