Abstract
In this paper we propose a general duality theory for a class of so called ‘max-separable’ optimization problems. In such problems functions h:R k → R of the form h(x 1, . . . , x k ) = max j h j (x j ), occur both as objective functions and as constraint functions (h j are assumed to be strictly increasing functions of one variable). As a result we obtain pairs of max-separable optimization problems, which possess both weak and strong duality property without a duality gap.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baccelli FL, Cohen G, Olsder GJ, Quadrat JP (1992) Synchronization and linearity, an algebra for discrete event systems. Wiley, Chichester
Chadha SS, Chadha V (2007) Linear fractional programming and duality. CEJOR 15: 119–125
Cuninghame-Green RA (1979) Minimax algebra, Lecture notes in economics and mathematical systems, vol 166. Springer, Berlin
Gavalec M, Zimmermann K (2010) Dual max-prod optimization problems. In: Proceedings of mathematical methods in economics, Part I, pp 168–176
Litvinov, GL, Maslov, VP, Sergeev , SN (eds) (2007) Idempotent and tropical mathematics and problems of mathematical Physics, vol I. Independent University, Moscow
Maslov VP, Samborskij SN (1992) Idempotent analysis, advances in soviet mathematics, vol 13. AMS, Providence
Vorobjov NN (1967) Extremal algebra of positive matrices (in Russian). Datenverarbeitung und Kybernetik 3: 39–71
Zhang Q (2008) Uniform LP duality for semi-definite and Semi-infinite programming. CEJOR 16: 205–213
Author information
Authors and Affiliations
Corresponding author
Additional information
Under the support of GAČR # 402/09/0405 and MSM0021620838.
Rights and permissions
About this article
Cite this article
Gavalec, M., Zimmermann, K. Duality for max-separable problems. Cent Eur J Oper Res 20, 409–419 (2012). https://doi.org/10.1007/s10100-011-0203-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-011-0203-x