Pareto Efficiency in Robust Optimization

Published Online:https://doi.org/10.1287/mnsc.2013.1753

References

  • Adida E, Joshi P (2009) A robust optimisation approach to project scheduling and resource allocation. Internat. J. Services, Oper. Informatics 4(2):169–193.CrossrefGoogle Scholar
  • Adida E, Perakis G (2006) A robust optimization approach to dynamic pricing and inventory control with no backorders. Math. Programming 107(1):97–129.CrossrefGoogle Scholar
  • Bandi C, Bertsimas D (2012) Tractable stochastic analysis in high dimensions via robust optimization. Math. Programming 134(1):23–70.CrossrefGoogle Scholar
  • Ben-Tal A, Nemirovski A (2002) Robust optimization—Methodology and applications. Math. Programming 92(3):453–480.CrossrefGoogle Scholar
  • Ben-Tal A, Nemirovski A (2007) Selected topics in robust convex optimization. Math. Programming 112(1):125–158.CrossrefGoogle Scholar
  • Ben-Tal A, Bertsimas D, Brown DB (2010) A soft robust model for optimization under ambiguity. Oper. Res. 58(4, part 2):1220–1234.LinkGoogle Scholar
  • Ben-Tal A, El-Ghaoui L, Nemirovski A (2009) Robust Optimization, Princeton Series in Applied Mathematics (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • Ben-Tal A, Margalit T, Nemirovski A (2000) Robust modeling of multi-stage portfolio problems. Frenk H, Roos K, Terlaky T, Zhang S, eds. High Performance Optimization (Kluwer Academic Publishers, Dordrecht, The Netherlands), 303–328.CrossrefGoogle Scholar
  • Ben-Tal A, Golany B, Nemirovski A, Vial J-P (2005) Retailer-supplier flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management 7(3): 248–271.LinkGoogle Scholar
  • Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.CrossrefGoogle Scholar
  • Bertsimas D, Pachamanova D (2008) Robust multiperiod portfolio management in the presence of transaction costs. Comput. Oper. Res. 35(1):3–17.CrossrefGoogle Scholar
  • Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1–3):49–71.CrossrefGoogle Scholar
  • Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper. Res. 54(1):150–168.LinkGoogle Scholar
  • Bertsimas D, Caramanis C, Brown DB (2011a) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.CrossrefGoogle Scholar
  • Bertsimas D, Farias VF, Trichakis N (2012) On the efficiency-fairness trade-off. Management Sci. 58(12):2234–2250.LinkGoogle Scholar
  • Bertsimas D, Iancu DA, Parrilo PA (2010) Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2):363–394.LinkGoogle Scholar
  • Bertsimas D, Iancu DA, Parrilo PA (2011b) A hierarchy of near-optimal policies for multistage adaptive optimization. IEEE Trans. Automatic Control 56(12):2809–2824.CrossrefGoogle Scholar
  • Bertsimas D, Litvinov E, Sun X, Zhao J, Zheng T (2013) Adaptive robust optimization for the security constrained unit commitment problem. IEEE Trans. Power Systems 28(1):52–63.CrossrefGoogle Scholar
  • Bienstock D, Özbay N (2008) Computing robust basestock levels. Discrete Optim. 5(2):389–414.CrossrefGoogle Scholar
  • Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Calafiore G (2007) Ambiguous risk measures and optimal robust portfolios. SIAM J. Optim. 18(3):853–877.CrossrefGoogle Scholar
  • Chan TC, Bortfeld T, Tsitsiklis JN (2006) A robust approach to IMRT optimization. Physics Medicine Biol. 51(10):2567–2583.CrossrefGoogle Scholar
  • Chen W, Unkelbach J, Trofimov A, Madden T, Kooy H, Bortfeld T, Craft D (2012) Including robustness in multi-criteria optimization for intensity-modulated proton therapy. Physics Medicine Biol. 57(3):591–608.CrossrefGoogle Scholar
  • Cohen I, Golany B, Shtub A (2007) The stochastic time-cost tradeoff problem: A robust optimization approach. Networks 49(2): 175–188.CrossrefGoogle Scholar
  • Cristobal MA, Parks GT, Clarkson PJ (2006) Finding robust solutions to multi-objective optimisation problems using polynomial chaos. Proc. 6th ASMO UK/ISSMO Conf. Engrg. Design Optim. CD-ROM. ASMO UK, Oxford, UK.Google Scholar
  • Deb K, Gupta H (2005) Searching for robust Pareto-optimal solutions in multi-objective optimization. Coello Coello CA, Hernández Aguirre A, Zitzler E, eds. Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science, Vol. 3410 (Springer, Berlin), 150–164.CrossrefGoogle Scholar
  • El-Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1):33–52.CrossrefGoogle Scholar
  • Fabozzi F, Kolm P, Pachamanova D, Focardi S (2007) Robust Portfolio Optimization and Management. Frank J. Fabozzi Series (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Fischetti M, Monaci M (2009) Light robustness. Ahuja R, Möhring R, Zaroliagis C, eds. Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science, Vol. 5868 (Springer, Berlin), 61–84.CrossrefGoogle Scholar
  • Gabrel V, Murat C, Thiele A (2012) Recent advances in robust optimization and robustness: An overview. Technical report, LAMSADE, Universite Paris-Dauphine, Paris.Google Scholar
  • Gabrel V, Murat C, Wu L (2013) New models for the robust shortest path problem: Complexity, resolution and generalization. Ann. Oper. Res. 207(1):97–120.CrossrefGoogle Scholar
  • Goh J, Hall N, Sim M (2010) Robust optimization strategies for total cost control in project management. Working paper, Stanford University, Stanford, CA.Google Scholar
  • Goldfarb D, Iyengar G (2003) Robust portfolio selection problems. Math. Oper. Res. 28(1):1–38.LinkGoogle Scholar
  • Gorissen BL, den Hertog D (2011) Approximating the Pareto set of multiobjective linear programs via robust optimization. CentER Discussion Paper 2012-031, Center for Economic Research, Tilburg University, Tilburg, The Netherlands.Google Scholar
  • Iancu DA, Sharma M, Sviridenko M (2013) Supermodularity and affine policies in dynamic robust optimization. Oper. Res. 61(4):941–956.LinkGoogle Scholar
  • Joshi S, Boyd S (2009) An efficient method for large-scale slack allocation. Engrg. Optim. 41(12):1163–1176.CrossrefGoogle Scholar
  • Kalai R, Lamboray R, Vanderpooten D (2012) Lexicographic α-robustness: An alternative to min–max criteria. Eur. J. Oper. Res. 220(3):722–728.CrossrefGoogle Scholar
  • Leung JY-T, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper. Res. 58(2):458–469.LinkGoogle Scholar
  • Lim AEB, Shanthikumar JG (2007) Relative entropy, exponential utility, and robust dynamic pricing. Oper. Res. 55(2):198–214.LinkGoogle Scholar
  • Luo B, Zheng J (2008) A new methodology for searching robust Pareto optimal solutions with MOEAs. Proc. IEEE World Congress Comput. Intelligence (IEEE, Piscataway, NJ), 580–586.Google Scholar
  • Luo Z-Q, Pang J-S, Ralph D (1996) Mathematical Programs with Equilibrium Constraints (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Natarajan K, Pachamanova D, Sim M (2008) Incorporating asymmetric distributional information in robust value-at-risk optimization. Management Sci. 54(3):573–585.LinkGoogle Scholar
  • Ogryczak W (1997) On the lexicographic minimax approach to location problems. Eur. J. Oper. Res. 100(3):566–585.CrossrefGoogle Scholar
  • Ono S, Nakayama S (2009) Multi-objective particle swarm optimization for robust optimization and its hybridization with gradient search. IEEE Congress Evolutionary Comput. (IEEE, Piscataway, NJ), 1629–1636.CrossrefGoogle Scholar
  • Perakis G, Roels G (2010) Robust controls for network revenue management. Manufacturing Service Oper. Management 12(1): 56–76.LinkGoogle Scholar
  • Rockafellar T (1970) Convex Analysis (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • Roy B (2010) Robustness in operational research and decision aiding: A multi-faceted issue. Eur. J. Oper. Res. 200(3):629–638.CrossrefGoogle Scholar
  • Rusmevichientong P, Topaloglu H (2012) Robust assortment optimization in revenue management under the multinomial logit choice model. Oper. Res. 60(4):865–882.LinkGoogle Scholar
  • Savage LJ (1972) The Foundations of Statistics, 2nd ed. (Dover Publications, Mineola, NY).Google Scholar
  • Schrijver A (2000) Theory of Linear and Integer Programming, 2nd ed. (John Wiley & Sons, Chichester, UK).Google Scholar
  • See C-T, Sim M (2010) Robust approximation to multiperiod inventory management. Oper. Res. 58(3):583–594.LinkGoogle Scholar
  • Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5):1154–1157.LinkGoogle Scholar
  • Sturm J, Polik I, Terlaky T (2006) SeDuMi 1.3. http://sedumi.ie.lehigh.edu/.Google Scholar
  • Suh M, Lee T (2001) Robust optimization method for the economic term in chemical process design and planning. Indust. Engrg. Chemistry Res. 40(25):5950–5959.CrossrefGoogle Scholar
  • Wiesemann W, Kuhn T, Rustem B (2012) Robust resource allocations in temporal networks. Math. Programming 135(1–2):437–471.CrossrefGoogle Scholar
  • Ye Y (1992) On the finite convergence of interior-point algorithms for linear programming. Math. Programming 57(1–3):325–335.CrossrefGoogle Scholar
  • Young HP (1995) Equity: In Theory and Practice (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.