Abstract
In this paper, we establish strong duality between affinely adjustable two-stage robust linear programs and their dual semidefinite programs under a general uncertainty set, that covers most of the commonly used uncertainty sets of robust optimization. This is achieved by first deriving a new version of Farkas’ lemma for a parametric linear inequality system with affinely adjustable variables. Our strong duality theorem not only shows that the primal and dual program values are equal, but also allows one to find the value of a two-stage robust linear program by solving a semidefinite linear program. In the case of an ellipsoidal uncertainty set, it yields a corresponding strong duality result with a second-order cone program as its dual. To illustrate the efficacy of our results, we show how optimal storage cost of an adjustable two-stage lot-sizing problem under a ball uncertainty set can be found by solving its dual semidefinite program, using a commonly available software.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Farkas, J.: Theorie der einfachen Ungleichungen. J. fur die reine und angewandte Mathematik 124, 1–27 (1901)
Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and probability, pp. 481–492. University of California Press, Berkeley, California (1951)
Dinh, N., Goberna, M.A., López, M.A., Mo, T.H.: From the Farkas lemma to the Hahn-Banach theorem. SIAM J. Optim. 24, 678–701 (2014)
Dinh, N., Goberna, M.A., López, M.A., Mo, T.H.: Robust optimization revisited via robust vector Farkas lemmas. Optimization 66, 939–963 (2017)
Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization. Wiley, Chichester (1998)
Dinh, N., Jeyakumar, V.: Farkas’ lemma: Three decades of generalizations for mathematical optimization. TOP 22, 1–22 (2014)
Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms. I Fundamentals. Springer, Berlin (1993)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
A. Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization, Princeton Ser. Appl. Math., Princeton University Press, Princeton (2009)
Yanikoglu, I., Gorissen, B.L., den Hertog, D.: A survey of adjustable robust optimization. Eur. J. Oper. Res. 277, 799–813 (2019)
Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99, 351–376 (2004)
Chen, A., Zhang, Y.: Uncertain linear programs: extended affinely adjustable robust counterparts. Oper. Res. 57(6), 1469–1482 (2009)
Delage, E., Iancu, D.A.: Robust multistage decision making. INFORMS Tutorials Oper. Res. Chap. 2, 20–46 (2015)
Kuhn, D., Wiesemann, W., Georghiou, A.: Primal and dual linear decision rules in stochastic and robust optimization. Math. Program. 130, 177–209 (2011)
Hadjiyiannis, M.J., Goulart, P.J., Kuhn, D.: A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 12–15 (2011)
Zhen, J., den Hertog, D., Sim, M.: Adjustable robust optimization via Fourier-Motzkin elimination. Oper. Res. 66, 1086–1100 (2018)
Ramana, M., Goldman, A.J.: Some geometric results in semidefinite programming. J. Global Optim. 7, 33–50 (1995)
Mordukhovich, B.S., Nam, M.N.: An Easy Path to Convex Analysis and Applications, Synthesis Lectures on Mathematics and Statistics, 14. Morgan & Claypool Publishers, Williston (2014)
Chuong, T.D., Jeyakumar, V.: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals. Linear Algebra Appl. 515, 38–52 (2017)
Bruns, W., Gubeladze, J.: Polytopes, Rings, and K-Theory. Springer, Dordrecht (2009)
Blekherman, G., Parrilo, P.A., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. World Publications, Philadelphia (2012)
Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pp. 95–110. Springer, Berlin (2008)
Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http://cvxr.com/cvx, March (2014)
Bertsimas, D., de Ruiter, F.J.C.T.: Duality in two-stage adaptive linear optimization: faster computation and stronger bounds. Inf. J. Comput. 28, 500–511 (2016)
Chuong, T.D., Jeyakumar, V.: Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the slater condition. J. Convex Anal. 25(4), 1159–1182 (2018)
Jeyakumar, V., Li, G., Perez, J.V.: Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. 9, 1–18 (2015)
Jeyakumar, V., Perez, J.V.: Dual semidefinite programs without duality gaps for a class of convex minimax programs. J. Optim. Theory Appl. 162, 735–753 (2014)
Acknowledgements
The authors would like to thank the associate editor and reviewer for valuable comments. Research was supported by a research grant from Australian Research Council.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Marcin Studniarski.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Chuong, T.D., Jeyakumar, V. Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs. J Optim Theory Appl 187, 488–519 (2020). https://doi.org/10.1007/s10957-020-01753-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-020-01753-3
Keywords
- Generalized Farkas’ lemma
- Semi-infinite linear system
- Adjustable robust linear programming
- Strong duality
- Conic programming