Abstract
We revisit Zalmai’s theorem, which is a partial generalization of Motzkin’s theorem of the alternative in the continuous-time setting. In particular, we provide two simple examples demonstrating that its existing proof is incorrect, and we demonstrate that a suitably modified variant of Zalmai’s theorem, concerned with the inconsistency of systems of convex inequalities and affine equalities, can be verified. We also derive two generalized variants of Motzkin’s theorem of the alternative in the continuous-time setting.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Mangasarian O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)
Craven B.D.: Control and Optimization. Chapman & Hall, London (1995)
Berkovitz L.D.: Convexity and Optimization in R n. Wiley, New York (2002)
Borwein J.M., Lewis A.S.: Partially-finite convex programming Part I: Quasirelative interiors and duality theory. Math. Program. 57, 15–48 (1992)
Singh C., Kiran M.: Continuous-time matrix programming. J. Math. Anal. Appl. 175, 280–291 (1993)
Borwein J.M., Goebel R.: Notions of relative interior in Banach spaces. J. Math. Sci. (N. Y.) 115, 2542–2553 (2003)
Cammaroto F., di Bella D.: Seeparation theorem based on the quasirelative interior and application to duality theorem. J. Optim. Theory Appl. 125, 223–229 (2005)
Zeng R., Caron R.J.: Generalized Motzkin theorems of the alternative and vector optimization problems. J. Optim. Theory Appl. 131(2), 281–299 (2006)
Daniele P., Giuffré S., Idone G., Maugeri A.: Infinite-dimensional duality and applications. Math. Ann. 339, 221–239 (2007)
Boţ R.I., Csetnek E.R., Moldovan A.: Revisiting some duality theorems via quasirelative interior in convex optimization. J. Optim. Theory Appl. 139, 67–84 (2008)
Boţ R.I., Csetnek E.R., Wanka G.: Regularity conditions via quasirelative interior in convex optimization. SIAM J. Optim. 19, 217–233 (2008)
Maugeri A., Raciti F.: On general infinite-dimensional complementarity problems. Optim. Lett. 2, 71–90 (2008)
Grad A.: Quasirelative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine inequalities. J. Math. Anal. Appl. 361, 86–95 (2010)
Zalmai G.J.: A continuous-time generalization of Gordan’s transposition theorem. J. Math. Anal. Appl. 110, 130–140 (1985)
Zalmai G.J.: The Fritz John and Kuhn–Tucker optimality conditions in continuous-time nonlinear programming. J. Math. Anal. Appl. 110, 503–518 (1985)
Brandao A.J.V., Rojas-Medar M.A., Silva G.N.: Nonsmooth continouous-time optimization problems: necessary conditions. Comput. Math. Appl. 41, 1447–1456 (2001)
de Oliveira V.A.: Vector continouous-time programming without differentiabillity. J. Comput. Appl. Math. 234, 924–933 (2010)
Zalmai G.J.: Optimality conditions and Lagrangian duality in continuous-time nonlinear programming. J. Math. Anal. Appl. 109, 426–452 (1985)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Janković, V., Marinković, B. & Raković, S.V. Motzkin’s theorem of the alternative: a continuous-time generalization. Optim Lett 7, 1659–1668 (2013). https://doi.org/10.1007/s11590-012-0513-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-012-0513-5