Abstract
By lexicographic maximization of the system of functions {fi(x)} k0 on a set M corresponding to permutation p = (i 0,...,i k) we mean the problem: Find x̃∈M such that vector \(\left[ {{f_{{i_0}}}\left( {\tilde x} \right), \ldots ,{f_{{i_k}}}\left( {\tilde x} \right)} \right]\) is a p-lexicographic maximum on the set
.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Eremin I.I. On the problems of successive programming // Sib. matem. jurn. 1973. T.14, No.1. P.53–63. (in Russian).
Eremin I.I. Penalty function method in convex programming // Dokl. AN SSSR. 1967. T.173, No.4. P.748–751. (in Russian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eremin, I.I. (1992). Lexicographic Duality in Linear Optimization. In: Pflug, G., Dieter, U. (eds) Simulation and Optimization. Lecture Notes in Economics and Mathematical Systems, vol 374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48914-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-48914-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54980-2
Online ISBN: 978-3-642-48914-3
eBook Packages: Springer Book Archive