IDEAS home Printed from https://ideas.repec.org/p/zbw/cauman/96.html
   My bibliography  Save this paper

A simulation study of simplification strategies in the development of optimization models

Author

Listed:
  • Knolmayer, Gerhard

Abstract

A major decision in the development of optimization models concerns the degree of accuracy to be used in the model. In practica, this simplification decision is widely met in an ad hoc fashion. Recently, several ways of Computing (worst-case) bounds for simplifying linear programming (LP) models have been developed. On the other hand, the need for empirical studies of simplification effects has been expressed. This paper discusses LP-models for product-mix planning in a job-shop in which manufacturing options exist. In this decision Situation some simplification (compared to the data used in nonsimultaneous planning) is often necessary to obtain a computa-tionally manageable LP model. Several simplification strategies are defined and applied in the Simulation study. Properties of the solutions obtained after applying the different simplification strategies are compared to those of the "real" Optimum. Significant differences of the objective function values allow ranking of the simplification strategies and giving recom-mendations for practical model development.

Suggested Citation

  • Knolmayer, Gerhard, 1981. "A simulation study of simplification strategies in the development of optimization models," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 96, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    • Handle: RePEc:zbw:cauman:96
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/190927/1/manuskript_096.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Raine, P. S. & Flavell, R. B. & Salkin, G. R., 1978. "Determining appropriate levels of data aggregation in a linear programming model," European Journal of Operational Research, Elsevier, vol. 2(1), pages 26-31, January.
    2. Stelios H. Zanakis, 1977. "Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods," Management Science, INFORMS, vol. 24(1), pages 91-104, September.
    3. Ward Whitt, 1978. "Approximations of Dynamic Programs, I," Mathematics of Operations Research, INFORMS, vol. 3(3), pages 231-243, August.
    4. Alvin C. Egbert & Hyung M. Kim, 1975. "Analysis of Aggregation Errors in Linear Programming Planning Models," American Journal of Agricultural Economics, Agricultural and Applied Economics Association, vol. 57(2), pages 292-301.
    5. Paul H. Zipkin, 1980. "Bounds on the Effect of Aggregating Variables in Linear Programs," Operations Research, INFORMS, vol. 28(2), pages 403-418, April.
    6. A. M. Geoffrion & G. W. Graves, 1974. "Multicommodity Distribution System Design by Benders Decomposition," Management Science, INFORMS, vol. 20(5), pages 822-844, January.
    7. Markku Kallio, 1977. "Computing bounds for the optimal value in linear programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 24(2), pages 301-308, June.
    8. A. M. Geoffrion, 1977. "A priori error bounds for procurement commodity aggregation in logistics planning models," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 24(2), pages 201-212, June.
    9. Ward Whitt, 1979. "Approximations of Dynamic Programs, II," Mathematics of Operations Research, INFORMS, vol. 4(2), pages 179-185, May.
    10. Paul H. Zipkin, 1980. "Bounds for Row-Aggregation in Linear Programming," Operations Research, INFORMS, vol. 28(4), pages 903-916, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ali Fattahi & Sriram Dasu & Reza Ahmadi, 2023. "Peak-Load Energy Management by Direct Load Control Contracts," Management Science, INFORMS, vol. 69(5), pages 2788-2813, May.
    2. Merrick, James H. & Weyant, John P., 2019. "On choosing the resolution of normative models," European Journal of Operational Research, Elsevier, vol. 279(2), pages 511-523.
    3. Srinivasa, Anand V. & Wilhelm, Wilbert E., 1997. "A procedure for optimizing tactical response in oil spill clean up operations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 554-574, November.
    4. Murwan Siddig & Yongjia Song, 2022. "Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse," Computational Optimization and Applications, Springer, vol. 81(1), pages 201-250, January.
    5. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    6. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    7. Robert Kirkby Author-Email: robertkirkby@gmail.com|, 2017. "Convergence of Discretized Value Function Iteration," Computational Economics, Springer;Society for Computational Economics, vol. 49(1), pages 117-153, January.
    8. Runggaldier, Wolfgang J., 1998. "Concepts and methods for discrete and continuous time control under uncertainty," Insurance: Mathematics and Economics, Elsevier, vol. 22(1), pages 25-39, May.
    9. Merrick, James H., 2016. "On representation of temporal variability in electricity capacity planning models," Energy Economics, Elsevier, vol. 59(C), pages 261-274.
    10. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2004. "Dynamic Programming Approximations for a Stochastic Inventory Routing Problem," Transportation Science, INFORMS, vol. 38(1), pages 42-70, February.
    11. ManMohan S. Sodhi, 2005. "LP Modeling for Asset-Liability Management: A Survey of Choices and Simplifications," Operations Research, INFORMS, vol. 53(2), pages 181-196, April.
    12. Gonzato, Sebastian & Bruninx, Kenneth & Delarue, Erik, 2021. "Long term storage in generation expansion planning models with a reduced temporal scope," Applied Energy, Elsevier, vol. 298(C).
    13. So, Wai Ping & Wan, Yat-wah, 2000. "A multi-grid size dynamic programming approach for the production control of a random-speed machine," International Journal of Production Economics, Elsevier, vol. 63(3), pages 267-275, January.
    14. William B. Haskell & Rahul Jain & Dileep Kalathil, 2016. "Empirical Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 402-429, May.
    15. Naci Saldi & Serdar Yüksel & Tamás Linder, 2017. "On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 945-978, November.
    16. Jie Ning & Matthew J. Sobel, 2019. "Easy Affine Markov Decision Processes," Operations Research, INFORMS, vol. 67(6), pages 1719-1737, November.
    17. Bjørndal, Endre & Jörnsten, Kurt, 2009. "Lower and upper bounds for linear production games," European Journal of Operational Research, Elsevier, vol. 196(2), pages 476-486, July.
    18. Alexander H. Gose & Brian T. Denton, 2016. "Sequential Bounding Methods for Two-Stage Stochastic Programs," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 351-369, May.
    19. Nicola Secomandi & François Margot, 2009. "Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 57(1), pages 214-230, February.
    20. Fu Lin & Sven Leyffer & Todd Munson, 2016. "A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings," Computational Optimization and Applications, Springer, vol. 65(1), pages 1-46, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:zbw:cauman:96. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/ibkiede.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.