Abstract
A Lagrangian duality theory is formulated for a large class of nonconvex optimization problems. The theoiy is based on the recent characterizations of global and local optima for partly convex programs. It uses basic notions from convex and parametric programming, such as the minimal index set of active constraints and continuity of the feasible set point-to-set mapping. The results are applied to the classic navigation problem of Zermelo. The primal problem consists of finding a steering angle that minimizes the sailing time to a target. Its dual solution is a function that associates, with every steering angle, the sensitivity of the sailing time relative to small perturbations of the target. The unconstrained minima of the dual solution yield the most “robust” steering angles.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bank, B., Guddat, J., Klatte, D., Kummer, B., and Tammer, K., Nonlinear Parametric Programming, Akademie-Verlag, Berlin, 1982.
Fiacco, A.V., Introduction to Sensitivity and Stability Analysis in Nonlinear Programming, Academic Press, New York, 1983.
Levitin, E.S ., Perturbation Theory in Mathematical Programming and its Applications, Nauka, Moscow, 1992. (In Russian.)
van Rooyen, M., Sears, M., and Zlobec, S., “Constraint qualifications in input optimization,” Journal of the Australian Mathematical Society 30 (Series B) (1989) pp. 326–342.
Vincent, T.L. and Grantham, W.J., Optimality in Parametric Systems, Wiley Interscience, New York, 1981.
Zermelo, E., “Uber das Navigationsproblem bei Ruhender Oder Verandorlicher Wind-verteilung,” Zeitschrift fur Angewandte Mathematik und Mechanik 11 (1931) pp. 114–124.
Zlobec, S., “Optimality conditions for a class of nonlinear programs,” Utilitas Mathematica 32 (1987) pp. 217–230.
Zlobec, S., “Characterizing optimality in nonconvex optimization,” Yugoslav Journal of Operations Research 1 (1991) 3–14; Addendum 2 (1992) pp. 69–71.
Zlobec, S ., “Partly convex programming,” Zbornik KOI’2 (V. Bahovec, Lj. Martic and L. Neralic, eds.) Proceedings of the Second Conference in Operations Research held in Rovinj, Croatia, October 5–7, 1992, Faculty of Economics, University of Zagreb (1992) pp. 33–50.
Zlobec, S ., “Some curious facts in global optimization,” Proceedings of the 16th International Conference on Infoimation Technology Interfaces (V. Ceric and V. Hljuz Dobric, eds.) University Computing Centre, University of Zagreb, Croatia (1994) pp. 13–28.
Zlobec, S., “Partly convex programming and Zermelo’s navigation problems,” Journal of Global Optimization (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Zlobec, S. (1996). Lagrange Duality in Partly Convex Programming. In: Floudas, C.A., Pardalos, P.M. (eds) State of the Art in Global Optimization. Nonconvex Optimization and Its Applications, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3437-8_1
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3437-8_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3439-2
Online ISBN: 978-1-4613-3437-8
eBook Packages: Springer Book Archive