메뉴 건너뛰기




Volumn 60, Issue 1, 2014, Pages 130-147

Pareto efficiency in robust optimization

Author keywords

Linear programming; Pareto optimality; Robust optimization

Indexed keywords

INVENTORY MANAGEMENT; LINEAR OPTIMIZATION PROBLEMS; NUMERICAL EXPERIMENTS; OPTIMIZATION PROBLEMS; PARETO-OPTIMALITY; PORTFOLIO OPTIMIZATION; ROBUST OPTIMIZATION; SUB-OPTIMAL PERFORMANCE;

EID: 84893587446     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.2013.1753     Document Type: Article
Times cited : (111)

References (57)
  • 1
    • 61849101735 scopus 로고    scopus 로고
    • A robust optimisation approach to project scheduling and resource allocation
    • Adida E, Joshi P (2009) A robust optimisation approach to project scheduling and resource allocation. Internat. J. Services, Oper. Informatics 4(2): 169-193.
    • (2009) Internat. J. Services, Oper. Informatics , vol.4 , Issue.2 , pp. 169-193
    • Adida, E.1    Joshi, P.2
  • 2
    • 33644701349 scopus 로고    scopus 로고
    • A robust optimization approach to dynamic pricing and inventory control with no backorders
    • Adida E, Perakis G (2006) A robust optimization approach to dynamic pricing and inventory control with no backorders. Math. Programming 107(1): 97-129.
    • (2006) Math. Programming , vol.107 , Issue.1 , pp. 97-129
    • Adida, E.1    Perakis, G.2
  • 3
    • 84865682855 scopus 로고    scopus 로고
    • Tractable stochastic analysis in high dimensions via robust optimization
    • Bandi C, Bertsimas D (2012) Tractable stochastic analysis in high dimensions via robust optimization. Math. Programming 134(1): 23-70.
    • (2012) Math. Programming , vol.134 , Issue.1 , pp. 23-70
    • Bandi, C.1    Bertsimas, D.2
  • 4
    • 0141712989 scopus 로고    scopus 로고
    • Robust optimization-Methodology and applications
    • Ben-Tal A, Nemirovski A (2002) Robust optimization-Methodology and applications. Math. Programming 92(3): 453-480.
    • (2002) Math. Programming , vol.92 , Issue.3 , pp. 453-480
    • Ben-Tal, A.1    Nemirovski, A.2
  • 5
    • 34547463520 scopus 로고    scopus 로고
    • Selected topics in robust convex optimization
    • Ben-Tal A, Nemirovski A (2007) Selected topics in robust convex optimization. Math. Programming 112(1): 125-158.
    • (2007) Math. Programming , vol.112 , Issue.1 , pp. 125-158
    • Ben-Tal, A.1    Nemirovski, A.2
  • 6
    • 77955904315 scopus 로고    scopus 로고
    • A soft robust model for optimization under ambiguity
    • Ben-Tal A, Bertsimas D, Brown DB (2010) A soft robust model for optimization under ambiguity. Oper. Res. 58(4, part 2): 1220-1234.
    • (2010) Oper. Res , vol.58 , Issue.4 PART 2 , pp. 1220-1234
    • Ben-Tal, A.1    Bertsimas, D.2    Brown, D.B.3
  • 8
    • 0038823167 scopus 로고    scopus 로고
    • Robust modeling of multi-stage portfolio problems
    • Frenk H, Roos K, Terlaky T, Zhang S, eds., (Kluwer Academic Publishers, Dordrecht, The Netherlands)
    • 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.
    • (2000) High Performance Optimization , pp. 303-328
    • Ben-Tal, A.1    Margalit, T.2    Nemirovski, A.3
  • 11
    • 34250179465 scopus 로고    scopus 로고
    • Robust multiperiod portfolio management in the presence of transaction costs
    • Bertsimas D, Pachamanova D (2008) Robust multiperiod portfolio management in the presence of transaction costs. Comput. Oper. Res. 35(1): 3-17.
    • (2008) Comput. Oper. Res , vol.35 , Issue.1 , pp. 3-17
    • Bertsimas, D.1    Pachamanova, D.2
  • 12
    • 84870613023 scopus 로고    scopus 로고
    • Robust discrete optimization and network flows
    • Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1-3): 49-71.
    • (2003) Math. Programming , vol.98 , Issue.1-3 , pp. 49-71
    • Bertsimas, D.1    Sim, M.2
  • 13
    • 33644559970 scopus 로고    scopus 로고
    • A robust optimization approach to inventory theory
    • Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper. Res. 54(1): 150-168.
    • (2006) Oper. Res , vol.54 , Issue.1 , pp. 150-168
    • Bertsimas, D.1    Thiele, A.2
  • 14
    • 84863393058 scopus 로고    scopus 로고
    • Theory and applications of robust optimization
    • Bertsimas D, Caramanis C, Brown DB (2011a) Theory and applications of robust optimization. SIAM Rev. 53(3): 464-501.
    • (2011) SIAM Rev , vol.53 , Issue.3 , pp. 464-501
    • Bertsimas, D.1    Caramanis, C.2    Brown, D.B.3
  • 15
  • 16
    • 77953089426 scopus 로고    scopus 로고
    • Optimality of affine policies in multistage robust optimization
    • Bertsimas D, Iancu DA, Parrilo PA (2010) Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2): 363-394.
    • (2010) Math. Oper. Res , vol.35 , Issue.2 , pp. 363-394
    • Bertsimas, D.1    Iancu, D.A.2    Parrilo, P.A.3
  • 17
    • 83255193558 scopus 로고    scopus 로고
    • A hierarchy of nearoptimal policies for multistage adaptive optimization
    • Bertsimas D, Iancu DA, Parrilo PA (2011b) A hierarchy of nearoptimal policies for multistage adaptive optimization. IEEE Trans. Automatic Control 56(12): 2809-2824.
    • (2011) IEEE Trans. Automatic Control , vol.56 , Issue.12 , pp. 2809-2824
    • Bertsimas, D.1    Iancu, D.A.2    Parrilo, P.A.3
  • 18
    • 84872853161 scopus 로고    scopus 로고
    • Adaptive robust optimization for the security constrained unit commitment problem
    • 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.
    • (2013) IEEE Trans. Power Systems , vol.28 , Issue.1 , pp. 52-63
    • Bertsimas, D.1    Litvinov, E.2    Sun, X.3    Zhao, J.4    Zheng, T.5
  • 19
    • 41149119059 scopus 로고    scopus 로고
    • Computing robust basestock levels
    • Bienstock D, Özbay N (2008) Computing robust basestock levels. Discrete Optim. 5(2): 389-414.
    • (2008) Discrete Optim , vol.5 , Issue.2 , pp. 389-414
    • Bienstock, D.1    Özbay, N.2
  • 21
    • 49449084457 scopus 로고    scopus 로고
    • Ambiguous risk measures and optimal robust portfolios
    • Calafiore G (2007) Ambiguous risk measures and optimal robust portfolios. SIAM J. Optim. 18(3): 853-877.
    • (2007) SIAM J. Optim , vol.18 , Issue.3 , pp. 853-877
    • Calafiore, G.1
  • 24
    • 34250637152 scopus 로고    scopus 로고
    • The stochastic time-cost tradeoff problem: A robust optimization approach
    • Cohen I, Golany B, Shtub A (2007) The stochastic time-cost tradeoff problem: A robust optimization approach. Networks 49(2): 175-188.
    • (2007) Networks , vol.49 , Issue.2 , pp. 175-188
    • Cohen, I.1    Golany, B.2    Shtub, A.3
  • 26
    • 24344452538 scopus 로고    scopus 로고
    • Searching for robust Pareto-optimal solutions in multi-objective optimization
    • Coello Coello CA, Hernández Aguirre A, Zitzler E, eds., (Springer, Berlin)
    • 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.
    • (2005) Evolutionary Multi- Criterion Optimization, Lecture Notes in Computer Science , vol.3410 , pp. 150-164
    • Deb, K.1    Gupta, H.2
  • 27
    • 0032252302 scopus 로고    scopus 로고
    • Robust solutions to uncertain semidefinite programs
    • El-Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1): 33-52.
    • (1998) SIAM J. Optim , vol.9 , Issue.1 , pp. 33-52
    • El-Ghaoui, L.1    Oustry, F.2    Lebret, H.3
  • 31
    • 84880512058 scopus 로고    scopus 로고
    • New models for the robust shortest path problem: Complexity, resolution and generalization
    • 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.
    • (2013) Ann. Oper. Res , vol.207 , Issue.1 , pp. 97-120
    • Gabrel, V.1    Murat, C.2    Wu, L.3
  • 33
    • 0038300035 scopus 로고    scopus 로고
    • Robust portfolio selection problems
    • Goldfarb D, Iyengar G (2003) Robust portfolio selection problems. Math. Oper. Res. 28(1): 1-38.
    • (2003) Math. Oper. Res , vol.28 , Issue.1 , pp. 1-38
    • Goldfarb, D.1    Iyengar, G.2
  • 35
    • 84883689327 scopus 로고    scopus 로고
    • Supermodularity and affine policies in dynamic robust optimization
    • Iancu DA, Sharma M, Sviridenko M (2013) Supermodularity and affine policies in dynamic robust optimization. Oper. Res. 61(4): 941-956.
    • (2013) Oper. Res , vol.61 , Issue.4 , pp. 941-956
    • Iancu, D.A.1    Sharma, M.2    Sviridenko, M.3
  • 36
    • 77951432201 scopus 로고    scopus 로고
    • An efficient method for large-scale slack allocation
    • Joshi S, Boyd S (2009) An efficient method for large-scale slack allocation. Engrg. Optim. 41(12): 1163-1176.
    • (2009) Engrg. Optim , vol.41 , Issue.12 , pp. 1163-1176
    • Joshi, S.1    Boyd, S.2
  • 37
    • 84859765320 scopus 로고    scopus 로고
    • Lexicographic α- Robustness: An alternative to min-max criteria
    • Kalai R, Lamboray R, Vanderpooten D (2012) Lexicographic α- robustness: An alternative to min-max criteria. Eur. J. Oper. Res. 220(3): 722-728.
    • (2012) Eur. J. Oper. Res , vol.220 , Issue.3 , pp. 722-728
    • Kalai, R.1    Lamboray, R.2    Vanderpooten, D.3
  • 38
    • 77951147055 scopus 로고    scopus 로고
    • Competitive two-agent scheduling and its applications
    • Leung JY-T, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper. Res. 58(2): 458-469.
    • (2010) Oper. Res , vol.58 , Issue.2 , pp. 458-469
    • Jy-T, L.1    Pinedo, M.2    Wan, G.3
  • 39
    • 34247526098 scopus 로고    scopus 로고
    • Relative entropy, exponential utility, and robust dynamic pricing
    • Lim AEB, Shanthikumar JG (2007) Relative entropy, exponential utility, and robust dynamic pricing. Oper. Res. 55(2): 198-214.
    • (2007) Oper. Res , vol.55 , Issue.2 , pp. 198-214
    • Lim, A.E.B.1    Shanthikumar, J.G.2
  • 40
    • 55749101583 scopus 로고    scopus 로고
    • A new methodology for searching robust Pareto optimal solutions with MOEAs
    • (IEEE, Piscataway, NJ)
    • 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.
    • (2008) Proc. IEEE World Congress Comput. Intelligence , pp. 580-586
    • Luo, B.1    Zheng, J.2
  • 42
    • 41549090406 scopus 로고    scopus 로고
    • Incorporating asymmetric distributional information in robust value-at-risk optimization
    • Natarajan K, Pachamanova D, Sim M (2008) Incorporating asymmetric distributional information in robust value-at-risk optimization. Management Sci. 54(3): 573-585.
    • (2008) Management Sci , vol.54 , Issue.3 , pp. 573-585
    • Natarajan, K.1    Pachamanova, D.2    Sim, M.3
  • 43
    • 0000216895 scopus 로고    scopus 로고
    • On the lexicographic minimax approach to location problems
    • Ogryczak W (1997) On the lexicographic minimax approach to location problems. Eur. J. Oper. Res. 100(3): 566-585.
    • (1997) Eur. J. Oper. Res , vol.100 , Issue.3 , pp. 566-585
    • Ogryczak, W.1
  • 44
    • 70450140395 scopus 로고    scopus 로고
    • Multi-objective particle swarm optimization for robust optimization and its hybridization with gradient search
    • (IEEE, Piscataway, NJ)
    • 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.
    • (2009) IEEE Congress Evolutionary Comput , pp. 1629-1636
    • Ono, S.1    Nakayama, S.2
  • 46
    • 0004267646 scopus 로고
    • (Princeton University Press, Princeton, NJ)
    • Rockafellar T (1970) Convex Analysis (Princeton University Press, Princeton, NJ).
    • (1970) Convex Analysis
    • Rockafellar, T.1
  • 47
    • 69749108455 scopus 로고    scopus 로고
    • Robustness in operational research and decision aiding: A multi-faceted issue
    • Roy B (2010) Robustness in operational research and decision aiding: A multi-faceted issue. Eur. J. Oper. Res. 200(3): 629-638.
    • (2010) Eur. J. Oper. Res , vol.200 , Issue.3 , pp. 629-638
    • Roy, B.1
  • 48
    • 84866415192 scopus 로고    scopus 로고
    • Robust assortment optimization in revenue management under the multinomial logit choice model
    • Rusmevichientong P, Topaloglu H (2012) Robust assortment optimization in revenue management under the multinomial logit choice model. Oper. Res. 60(4): 865-882.
    • (2012) Oper. Res , vol.60 , Issue.4 , pp. 865-882
    • Rusmevichientong, P.1    Topaloglu, H.2
  • 51
    • 77953568374 scopus 로고    scopus 로고
    • Robust approximation to multiperiod inventory management
    • See C-T, Sim M (2010) Robust approximation to multiperiod inventory management. Oper. Res. 58(3): 583-594.
    • (2010) Oper. Res , vol.58 , Issue.3 , pp. 583-594
    • See, C.-T.1    Sim, M.2
  • 52
    • 0010680207 scopus 로고
    • Convex programming with set-inclusive constraints and applications to inexact linear programming
    • Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5): 1154-1157.
    • (1973) Oper. Res , vol.21 , Issue.5 , pp. 1154-1157
    • Soyster, A.L.1
  • 54
    • 0035851993 scopus 로고    scopus 로고
    • Robust optimization method for the economic term in chemical process design and planning
    • 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.
    • (2001) Indust. Engrg. Chemistry Res , vol.40 , Issue.25 , pp. 5950-5959
    • Suh, M.1    Lee, T.2
  • 55
    • 84866251566 scopus 로고    scopus 로고
    • Robust resource allocations in temporal networks
    • Wiesemann W, Kuhn T, Rustem B (2012) Robust resource allocations in temporal networks. Math. Programming 135(1-2): 437-471.
    • (2012) Math. Programming , vol.135 , Issue.1-2 , pp. 437-471
    • Wiesemann, W.1    Kuhn, T.2    Rustem, B.3
  • 56
    • 30244459714 scopus 로고
    • On the finite convergence of interior-point algorithms for linear programming
    • Ye Y (1992) On the finite convergence of interior-point algorithms for linear programming. Math. Programming 57(1-3): 325-335.
    • (1992) Math. Programming , vol.57 , Issue.1-3 , pp. 325-335
    • Ye, Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.