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


     


MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
Vol. 7, No. 3, Summer 2005, pp. 248-271
DOI: 10.1287/msom.1050.0081
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 Ben-Tal, A.
Right arrow Articles by Vial, J.-P.
Right arrow Search for Related Content

Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach

Aharon Ben-Tal, Boaz Golany, Arkadi Nemirovski, Jean-Philippe Vial

Faculty of Industrial Engineering and Management, Technion—Israel Institute of Technology, Haifa 32000, Israel
Faculty of Industrial Engineering and Management, Technion—Israel Institute of Technology, Haifa 32000, Israel
Faculty of Industrial Engineering and Management, Technion—Israel Institute of Technology, Haifa 32000, Israel
Department of Management Studies, University of Geneva, 40 Bd du Pont d’Arve, CH-1211 Geneva 4, Switzerland

abental{at}ie.technion.ac.il
golany{at}ie.technion.ac.il
nemirovs{at}ie.technion.ac.il
jean-philippe.vial{at}hec.unige.ch

We propose the use of robust optimization (RO) as a powerful methodology for multiperiod stochastic operations management problems. In particular, we study a two-echelon multiperiod supply chain problem, known as the retailer-supplier flexible commitment (RSFC) problem with uncertain demand that is only known to reside in some uncertainty set. We adopt a min-max criterion, whereby the cost function is minimized against the worst case demand occurrence. To solve the min-max RSFC problem we employ a recent extension of the RO method adapted to dynamic decision problems and known as the affinely adjustable robust counterpart (AARC) methodology. The AARC solution is tested by a large simulation study and found to provide excellent results.

Key Words: robust optimization; affinely adjustable robust optimization; flexible commitment contracts; supply chain management; min-max criterion
History: Received: February 24, 2003; accepted: April 27, 2005.




This article has been cited by other articles:


Home page
Operations ResearchHome page
X. Chen and Y. Zhang
Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
Operations Research, November 1, 2009; 57(6): 1469 - 1482.
[Abstract] [PDF]


Home page
Mathematics of Operations ResearchHome page
D. Kuhn
An Information-Based Approximation Scheme for Stochastic Optimization Problems in Continuous Time
Mathematics of Operations Research, May 1, 2009; 34(2): 428 - 444.
[Abstract] [PDF]


Home page
Operations ResearchHome page
X. Chen, M. Sim, P. Sun, and J. Zhang
A Linear Decision-Based Approximation Approach to Stochastic Programming
Operations Research, March 1, 2008; 56(2): 344 - 357.
[Abstract] [PDF]


Home page
Operations ResearchHome page
X. Chen, M. Sim, and P. Sun
A Robust Optimization Perspective on Stochastic Programming
Operations Research, November 1, 2007; 55(6): 1058 - 1071.
[Abstract] [PDF]




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