Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 57, No. 6, November-December 2009, pp. 1469-1482
DOI: 10.1287/opre.1080.0605
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Chen, X.
Right arrow Articles by Zhang, Y.
Right arrow Search for Related Content

Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts

Xin Chen, Yuhan Zhang

Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801

xinchen{at}illinois.edu
yzhang30{at}illinois.edu

In this paper, we introduce the extended affinely adjustable robust counterpart to modeling and solving multistage uncertain linear programs with fixed recourse. Our approach first reparameterizes the primitive uncertainties and then applies the affinely adjustable robust counterpart proposed in the literature, in which recourse decisions are restricted to be linear in terms of the primitive uncertainties. We propose a special case of the extended affinely adjustable robust counterpart—the splitting-based extended affinely adjustable robust counterpart—and illustrate both theoretically and computationally that the potential of the affinely adjustable robust counterpart method is well beyond the one presented in the literature. Similar to the affinely adjustable robust counterpart, our approach ends up with deterministic optimization formulations that are tractable and scalable to multistage problems.

Subject classifications: programming; stochastic.
History: Received March 2007; revision received January 2008; accepted March 2008.




This article has been cited by other articles:


Home page
Operations ResearchHome page
J. Goh and M. Sim
Distributionally Robust Optimization and Its Tractable Approximations
Operations Research, July 1, 2010; 58(4-Part-1): 902 - 917.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.