IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v75y2019i2d10.1007_s10898-019-00817-7.html
   My bibliography  Save this article

Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations

Author

Listed:
  • Erfan Mehmanchi

    (University of Pittsburgh)

  • Andrés Gómez

    (University of Southern California)

  • Oleg A. Prokopyev

    (University of Pittsburgh)

Abstract

This paper focuses on methods that improve the performance of solution approaches for multiple-ratio fractional 0–1 programs (FPs) in their general structure. In particular, we explore the links between equivalent mixed-integer linear programming and conic quadratic programming reformulations of FPs. Thereby, we show that integrating the ideas behind these two types of reformulations of FPs allows us to push further the limits of the current state-of-the-art results and tackle larger-size problems. We perform extensive computational experiments to compare the proposed approaches against the current reformulations from the literature.

Suggested Citation

  • Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev, 2019. "Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations," Journal of Global Optimization, Springer, vol. 75(2), pages 273-339, October.
    • Handle: RePEc:spr:jglopt:v:75:y:2019:i:2:d:10.1007_s10898-019-00817-7
    DOI: 10.1007/s10898-019-00817-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00817-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-019-00817-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Andrew C. Trapp & Renata A. Konrad, 2015. "Finding diverse optima and near-optima to binary integer programs," IISE Transactions, Taylor & Francis Journals, vol. 47(11), pages 1300-1312, November.
    2. Andrew Trapp & Oleg A. Prokopyev & Stanislav Busygin, 2010. "Finding checkerboard patterns via fractional 0–1 programming," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 1-26, July.
    3. Edoardo Amaldi & Sandro Bosio & Federico Malucelli & Di Yuan, 2011. "Solving Nonlinear Covering Problems Arising in WLAN Design," Operations Research, INFORMS, vol. 59(1), pages 173-187, February.
    4. Juan José Miranda Bront & Isabel Méndez-Díaz & Gustavo Vulcano, 2009. "A Column Generation Algorithm for Choice-Based Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 769-784, June.
    5. Schaible, Siegfried & Ibaraki, Toshidide, 1983. "Fractional programming," European Journal of Operational Research, Elsevier, vol. 12(4), pages 325-338, April.
    6. Wu, Tai-Hsi, 1997. "A note on a global approach for general 0-1 fractional programming," European Journal of Operational Research, Elsevier, vol. 101(1), pages 220-223, August.
    7. Jacob Feldman & Huseyin Topaloglu, 2015. "Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits," Production and Operations Management, Production and Operations Management Society, vol. 24(10), pages 1598-1620, October.
    8. Juan Pablo Vielma & Shabbir Ahmed & George L. Nemhauser, 2008. "A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 438-450, August.
    9. Aharon Ben-Tal & Arkadi Nemirovski, 2001. "On Polyhedral Approximations of the Second-Order Cone," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 193-205, May.
    10. Shivaram Subramanian & Hanif Sherali, 2010. "A fractional programming approach for retail category price optimization," Journal of Global Optimization, Springer, vol. 48(2), pages 263-277, October.
    11. James M. Davis & Guillermo Gallego & Huseyin Topaloglu, 2014. "Assortment Optimization Under Variants of the Nested Logit Model," Operations Research, INFORMS, vol. 62(2), pages 250-273, April.
    12. Paat Rusmevichientong & Zuo-Jun Max Shen & David B. Shmoys, 2010. "Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint," Operations Research, INFORMS, vol. 58(6), pages 1666-1680, December.
    13. Stanislav Busygin & Oleg A. Prokopyev & Panos M. Pardalos, 2005. "Feature Selection for Consistent Biclustering via Fractional 0–1 Programming," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 7-21, August.
    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. Jose Joaquin del Pozo-Antúnez & Francisco Fernández-Navarro & Horacio Molina-Sánchez & Antonio Ariza-Montes & Mariano Carbonero-Ruz, 2021. "The Machine-Part Cell Formation Problem with Non-Binary Values: A MILP Model and a Case of Study in the Accounting Profession," Mathematics, MDPI, vol. 9(15), pages 1-16, July.
    2. Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev, 2021. "Solving a class of feature selection problems via fractional 0–1 programming," Annals of Operations Research, Springer, vol. 303(1), pages 265-295, August.

    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. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    2. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    3. Flores, Alvaro & Berbeglia, Gerardo & Van Hentenryck, Pascal, 2019. "Assortment optimization under the Sequential Multinomial Logit Model," European Journal of Operational Research, Elsevier, vol. 273(3), pages 1052-1064.
    4. Sumit Kunnumkal & Victor Martínez-de-Albéniz, 2019. "Tractable Approximations for Assortment Planning with Product Costs," Operations Research, INFORMS, vol. 67(2), pages 436-452, March.
    5. Ali Aouad & Danny Segev, 2021. "Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences," Management Science, INFORMS, vol. 67(6), pages 3519-3550, June.
    6. Çömez-Dolgan, Nagihan & Moussawi-Haidar, Lama & Jaber, Mohamad Y. & Cephe, Ecem, 2022. "Capacitated assortment planning of a multi-location system under transshipments," International Journal of Production Economics, Elsevier, vol. 251(C).
    7. Mehrani, Saharnaz & Sefair, Jorge A., 2022. "Robust assortment optimization under sequential product unavailability," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1027-1043.
    8. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    9. Kameng Nip & Zhenbo Wang & Zizhuo Wang, 2021. "Assortment Optimization under a Single Transition Choice Model," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2122-2142, July.
    10. Mika Sumida & Guillermo Gallego & Paat Rusmevichientong & Huseyin Topaloglu & James Davis, 2021. "Revenue-Utility Tradeoff in Assortment Optimization Under the Multinomial Logit Model with Totally Unimodular Constraints," Management Science, INFORMS, vol. 67(5), pages 2845-2869, May.
    11. Ali Aouad & Vivek Farias & Retsef Levi, 2021. "Assortment Optimization Under Consider-Then-Choose Choice Models," Management Science, INFORMS, vol. 67(6), pages 3368-3386, June.
    12. Ali Aouad & Jacob Feldman & Danny Segev, 2023. "The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?," Management Science, INFORMS, vol. 69(5), pages 2814-2832, May.
    13. W. Zachary Rayfield & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 335-357, May.
    14. Gallego, Guillermo & Li, Anran & Truong, Van-Anh & Wang, Xinshang, 2020. "Approximation algorithms for product framing and pricing," LSE Research Online Documents on Economics 101983, London School of Economics and Political Science, LSE Library.
    15. Meng Qi & Ho‐Yin Mak & Zuo‐Jun Max Shen, 2020. "Data‐driven research in retail operations—A review," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 595-616, December.
    16. Jacob B. Feldman & Huseyin Topaloglu, 2015. "Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model," Operations Research, INFORMS, vol. 63(4), pages 812-822, August.
    17. Chan, Rebecca & Li, Zhaolin & Matsypura, Dmytro, 2020. "Assortment optimisation problem: A distribution-free approach," Omega, Elsevier, vol. 95(C).
    18. Jacob B. Feldman & Huseyin Topaloglu, 2017. "Revenue Management Under the Markov Chain Choice Model," Operations Research, INFORMS, vol. 65(5), pages 1322-1342, October.
    19. C. I. Chiang, 2023. "Availability control under online reviews in hospitality," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 22(5), pages 385-398, October.
    20. Çömez-Dolgan, Nagihan & Dağ, Hilal & Fescioglu-Unver, Nilgun & Şen, Alper, 2023. "Multi-plant manufacturing assortment planning in the presence of transshipments," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1033-1050.

    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:spr:jglopt:v:75:y:2019:i:2:d:10.1007_s10898-019-00817-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.