Deterministic approximations to co-production problems with service constraints
Includes bibliographical references (p. 31-32).
|Date of creation:||1989|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://mitsloan.mit.edu/
More information through EDIRC
|Order Information:|| Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Yrjö Seppälä, 1971. "Constructing Sets of Uniformly Tighter Linear Approximations for a Chance Constraint," Management Science, INFORMS, vol. 17(11), pages 736-749, July.
- Uday S. Karmarkar, 1987. "The Multilocation Multiperiod Inventory Problem: Bounds and Approximations," Management Science, INFORMS, vol. 33(1), pages 86-94, January.
- Fredrick S. Hillier, 1967. "Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables," Management Science, INFORMS, vol. 14(1), pages 34-57, September.
When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:2270. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann)
If references are entirely missing, you can add them using this form.