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. 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.
    2. 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.
    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. Carvalho, Margarida & Lodi, Andrea, 2023. "A theoretical and computational equilibria analysis of a multi-player kidney exchange program," European Journal of Operational Research, Elsevier, vol. 305(1), pages 373-385.
    2. Friberg, Christian & Haase, Knut, 1996. "An exact algorithm for the vehicle and crew scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 416, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    4. Church, Richard L. & Murray, Alan T. & Figueroa, Michael A. & Barber, Klaus H., 2000. "Support system development for forest ecosystem management," European Journal of Operational Research, Elsevier, vol. 121(2), pages 247-258, March.
    5. Chowdhury, Sudipta & Emelogu, Adindu & Marufuzzaman, Mohammad & Nurre, Sarah G. & Bian, Linkan, 2017. "Drones for disaster response and relief operations: A continuous approximation model," International Journal of Production Economics, Elsevier, vol. 188(C), pages 167-184.
    6. Zachary A. Collier & James H. Lambert, 2019. "Principles and methods of model validation for model risk reduction," Environment Systems and Decisions, Springer, vol. 39(2), pages 146-153, June.
    7. 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.
    8. Tsao, Yu-Chung & Lu, Jye-Chyi, 2012. "A supply chain network design considering transportation cost discounts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 401-414.
    9. 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.
    10. 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.
    11. Crönert, Tobias & Martin, Layla & Minner, Stefan & Tang, Christopher S., 2024. "Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection," European Journal of Operational Research, Elsevier, vol. 312(3), pages 938-953.
    12. Cowell, Robert G., 2013. "A simple greedy algorithm for reconstructing pedigrees," Theoretical Population Biology, Elsevier, vol. 83(C), pages 55-63.
    13. 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.
    14. 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.
    15. Perry, Gregory M. & Rister, M. Edward & Richardson, James W. & Grant, Warren R., 1986. "Analyzing Tenure Arrangements and Crop Rotations Using Farm Simulation and Probit Analysis," Journal of Agricultural and Applied Economics, Cambridge University Press, vol. 18(2), pages 165-174, December.
    16. 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.
    17. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
    18. Clímaco, João C.N. & Eugénia Captivo, M. & Pascoal, Marta M.B., 2010. "On the bicriterion - minimal cost/minimal label - spanning tree problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 199-205, July.
    19. Chong Hyun Park & Gemma Berenguer, 2020. "Supply Constrained Location‐Distribution in Not‐for‐Profit Settings," Production and Operations Management, Production and Operations Management Society, vol. 29(11), pages 2461-2483, November.
    20. Meltem Peker & Bahar Y. Kara & James F. Campbell & Sibel A. Alumur, 2016. "Spatial Analysis of Single Allocation Hub Location Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1075-1101, December.

    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.