2017
Том 69
№ 7

All Issues

Symmetric duality for lexicographic linear programming problems

Eremin I. I.

Full text (.pdf)


Abstract

A symmetric pair of lexicographic linear-programming (LP) problems, connected by regular relations, is formulated for problems of multicriteria linear optimization. A duality theorem for improper linear-programming problems (ILPP) is constructed in terms of lexicographic optimization.

English version (Springer): Ukrainian Mathematical Journal 44 (1992), no. 6, pp 690-696.

Citation Example: Eremin I. I. Symmetric duality for lexicographic linear programming problems // Ukr. Mat. Zh. - 1992. - 44, № 6. - pp. 766–773.

Full text