Symmetric duality for lexicographic linear programming problems
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.