| [1] Liu P F, Yang W G, Guo T D. A discussion on the conservatism of robust linear optimization problems[J/OL]. Eprints for the optimization community. (2014-10)[2015-01-10]. http://www.optimization-online.org/DB_HTML/2014/10/4598.html.[2] Soyster A L. Technical note-convex programming with set-inclusive constraints and applications to inexact linearprogramming[J]. Operations Research, 1973, 21(5):1154-1157.[3] Bertsimas D, Sim M. The price of robustness[J]. Operations Research, 2004, 52(1):35-53.[4] Ben-Tal A, Nemirovski A. Robust convex optimization[J]. Mathematics of Operations Research, 1998, 23(4):769-805.[5] Ben-Tal A, Nemirovski A. Robust solutions of uncertain linear programs[J]. Operations Research Letters, 1999, 25(1):1-13.[6] EI-Ghaoui L, Lebret H. Robust solutions to least-square problems to uncertain data matrices[J]. Sima Journal on Matrix Analysis and Applications, 1997, 18:1035-1064.[7] El Ghaoui L, Oustry F, Lebret H. Robust solutions to uncertain semidefinite programs[J]. SIAM Journal on Optimization, 1998, 9(1):33-52.[8] Hillier F S, Lieberman G J. Introduction to operations research[M].9th ed. San Francisco:Mc Graw Hill-Higher Education, 2010:107-109.[9] Adler I, Karp R M, Shamir R. A simplex variant solving an m×d linear program in O(min(m2,d2)) expected number of pivot steps[J]. Journal of Complexity, 1987, 3(4):372-387. |
