Lagrange Duality in Partly Convex Programming
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.
KeywordsDual problem partly convex programming characterizations of optimality global optimum local optimum Zermelo’s navigation problem
Unable to display preview. Download preview PDF.
- 1.Bank, B., Guddat, J., Klatte, D., Kummer, B., and Tammer, K., Nonlinear Parametric Programming, Akademie-Verlag, Berlin, 1982.Google Scholar
- 3.Levitin, E.S ., Perturbation Theory in Mathematical Programming and its Applications, Nauka, Moscow, 1992. (In Russian.)Google Scholar
- 9.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.Google Scholar
- 10.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.Google Scholar
- 11.Zlobec, S., “Partly convex programming and Zermelo’s navigation problems,” Journal of Global Optimization (to appear).Google Scholar