IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v44y2014i4p428-431.html
   My bibliography  Save this article

ASP, The Art and Science of Practice: A (Very) Short Course in Suboptimization

Author

Listed:
  • Jeffrey D. Camm

    (Department of Operations, Business Analytics and Information Systems, Lindner College of Business, University of Cincinnati, Cincinnati, Ohio 45221)

Abstract

Sometimes being suboptimal is best. Cuts to the unit hypercube, as Balas and Jeroslow discuss [Balas E, Jeroslow R (1972) Canonical cuts on the unit hypercube. SIAM J. Appl. Math. 23(1):61–69], provide a simple approach to generating alternative optima and (or) providing a family of suboptimal solutions for one’s clients to consider. In this paper, I discuss how to generate useful suboptimal solutions using Balas and Jeroslow’s cuts to the unit hypercube and why clients are willing to pay for them.

Suggested Citation

  • Jeffrey D. Camm, 2014. "ASP, The Art and Science of Practice: A (Very) Short Course in Suboptimization," Interfaces, INFORMS, vol. 44(4), pages 428-431, August.
    • Handle: RePEc:inm:orinte:v:44:y:2014:i:4:p:428-431
    DOI: 10.1287/inte.2014.0754
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2014.0754
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2014.0754?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Tsai, Jung-Fa & Lin, Ming-Hua & Hu, Yi-Chung, 2008. "Finding multiple solutions to general integer linear programs," European Journal of Operational Research, Elsevier, vol. 184(2), pages 802-809, January.
    2. Arthur M. Geoffrion, 1976. "The Purpose of Mathematical Programming is Insight, Not Numbers," Interfaces, INFORMS, vol. 7(1), pages 81-92, November.
    3. Eugene L. Lawler, 1972. "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem," Management Science, INFORMS, vol. 18(7), pages 401-405, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Brendan K. Eagen & Timothy C. Y. Chan & Michael W. Carter, 2018. "Women’s College Hospital Uses Operations Research to Create an Ambulatory Clinic Schedule," Service Science, INFORMS, vol. 10(3), pages 230-240, September.
    2. Thierry Petit & Andrew C. Trapp, 2019. "Enriching Solutions to Combinatorial Problems via Solution Engineering," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 429-444, July.
    3. Jeffrey D. Camm & Jeremy Christman & A. Narayanan, 2022. "Total Unduplicated Reach and Frequency Optimization at Procter & Gamble," Interfaces, INFORMS, vol. 52(2), pages 149-157, March.

    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. Chen, Chao, 2003. "Freeway Performance Measurement System (PeMS)," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt6j93p90t, Institute of Transportation Studies, UC Berkeley.
    2. van den Burg, A.J. & van der Ham, R.T. & Kleijnen, J.P.C., 1977. "Generalizations of simulation results : Practicality of statistical methods (Part one)," Research Memorandum FEW 67, Tilburg University, School of Economics and Management.
    3. James F. Campbell, 2017. "Comments on: Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 434-437, October.
    4. Francesca Guerriero & Roberto Musmanno & Valerio Lacagnina & Antonio Pecorella, 2001. "A Class of Label-Correcting Methods for the K Shortest Paths Problem," Operations Research, INFORMS, vol. 49(3), pages 423-429, June.
    5. Huang, Rongbing & Menezes, Mozart B.C. & Kim, Seokjin, 2012. "The impact of cost uncertainty on the location of a distribution center," European Journal of Operational Research, Elsevier, vol. 218(2), pages 401-407.
    6. Gerald G. Brown & Richard E. Rosenthal, 2008. "Optimization Tradecraft: Hard-Won Insights from Real-World Decision Support," Interfaces, INFORMS, vol. 38(5), pages 356-366, October.
    7. Richard Francis & Timothy Lowe, 2014. "Comparative error bound theory for three location models: continuous demand versus discrete demand," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 144-169, April.
    8. Lieven Demeester & Mei Qi & Luk N. Van Wassenhove, 2013. "Plant Networks for Processing Recyclable Materials," Manufacturing & Service Operations Management, INFORMS, vol. 15(4), pages 670-688, October.
    9. Kleijnen, J.P.C., 1977. "Generalizing simulation results through metamodels," Other publications TiSEM e671b2d6-c334-4938-99aa-3, Tilburg University, School of Economics and Management.
    10. Kleijnen, J.P.C., 1978. "The role of statistical methodology in simulation," Other publications TiSEM 05085a08-4669-4775-adc5-4, Tilburg University, School of Economics and Management.
    11. Guazzelli, Cauê Sauter & Cunha, Claudio B., 2018. "Exploring K-best solutions to enrich network design decision-making," Omega, Elsevier, vol. 78(C), pages 139-164.
    12. Buu-Chau Truong & Kim-Hung Pho & Van-Buol Nguyen & Bui Anh Tuan & Wing-Keung Wong, 2019. "Graph Theory And Environmental Algorithmic Solutions To Assign Vehicles Application To Garbage Collection In Vietnam," Advances in Decision Sciences, Asia University, Taiwan, vol. 23(3), pages 1-35, September.
    13. Sébastien Giguère & François Laviolette & Mario Marchand & Denise Tremblay & Sylvain Moineau & Xinxia Liang & Éric Biron & Jacques Corbeil, 2015. "Machine Learning Assisted Design of Highly Active Peptides for Drug Discovery," PLOS Computational Biology, Public Library of Science, vol. 11(4), pages 1-21, April.
    14. Elena Fernández & Justo Puerto & Antonio Rodríguez-Chía, 2013. "On discrete optimization with ordering," Annals of Operations Research, Springer, vol. 207(1), pages 83-96, August.
    15. Calvin Sonntag & Thomas A. Grossman, 1999. "End-User Modeling Improves R&D Management at AgrEvo Canada, Inc," Interfaces, INFORMS, vol. 29(5), pages 132-142, October.
    16. Irineu de Brito & Silvia Uneddu & Emma Maspero & Paulo Gonçalves, 2020. "Optimizing Long-Lasting Insecticidal Nets Campaign in Ivory Coast," Logistics, MDPI, vol. 4(3), pages 1-21, August.
    17. Sy, Charlle L. & Aviso, Kathleen B. & Ubando, Aristotle T. & Tan, Raymond R., 2016. "Target-oriented robust optimization of polygeneration systems under uncertainty," Energy, Elsevier, vol. 116(P2), pages 1334-1347.
    18. Z Fu & R Eglese & L Y O Li, 2005. "A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 267-274, March.
    19. Ehrgott, Matthias & Skriver, Anders J. V., 2003. "Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach," European Journal of Operational Research, Elsevier, vol. 147(3), pages 657-664, June.
    20. Steiger, David M. & Sharda, Ramesh, 1996. "Analyzing mathematical models with inductive learning networks," European Journal of Operational Research, Elsevier, vol. 93(2), pages 387-401, September.

    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:inm:orinte:v:44:y:2014:i:4:p:428-431. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.