IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/14658.html
   My bibliography  Save this paper

A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)

Author

Listed:
  • Sinha, Ankur
  • Das, Arka
  • Anand, Guneshwar
  • Jayaswal, Sachin

Abstract

In this article, we discuss an exact algorithm for mixed integer concave minimization problems. A piece wise inner-approximation of the concave function is achieved using an auxiliary linear program that leads to a bilevel program, which provides a lower bound to the original problem. The bilevel program is reduced to a single-level formulation with the help of Karush-Kuhn-Tucker(KKT) conditions. Incorporating the KKT conditions lead to complementary slackness conditions that are linearized using BigM. Multiple bilevel programs, When solved over iterations, guarantee convergence to the exact optimum of the original problem. Though the algorithm is general and can be applied to any optimization problem with concave function(s), in this paper, we solve two common classes of operations and supply chain problems; namely, the concave knapsack problem, and the concave production transportation problem. The computational experiments indicate that our proposed approach out performs the customized methods that have been used in the literature to solve the two classes of problems by an order of magnitude in most of the test cases.

Suggested Citation

  • Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:14658
    as

    Download full text from publisher

    File URL: https://www.iima.ac.in/sites/default/files/rnpfiles/3946511502021-03-01.pdf
    File Function: English Version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Harold P. Benson, 1985. "A finite algorithm for concave minimization over a polyhedron," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 32(1), pages 165-177, February.
    2. James E. Falk & Karla R. Hoffman, 1976. "A Successive Underestimation Method for Concave Minimization Problems," Mathematics of Operations Research, INFORMS, vol. 1(3), pages 251-259, August.
    3. Philip B. Zwart, 1974. "Global Maximization of a Convex Function with Linear Inequality Constraints," Operations Research, INFORMS, vol. 22(3), pages 602-609, June.
    4. Alberto Caprara & David Pisinger & Paolo Toth, 1999. "Exact Solution of the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 125-137, May.
    5. Hamdy A. Taha, 1973. "Concave minimization over a convex polyhedron," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 20(3), pages 533-548, September.
    6. Strekalovsky, Alexander S., 2015. "On local search in d.c. optimization problems," Applied Mathematics and Computation, Elsevier, vol. 255(C), pages 73-83.
    7. A. Victor Cabot & S. Selcuk Erenguc, 1986. "A branch and bound algorithm for solving a class of nonlinear integer programming problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(4), pages 559-567, November.
    8. Duan Li & Xiaoling Sun, 2006. "Nonlinear Integer Programming," International Series in Operations Research and Management Science, Springer, number 978-0-387-32995-6, September.
    9. Katta G. Murty, 1968. "Solving the Fixed Charge Problem by Ranking the Extreme Points," Operations Research, INFORMS, vol. 16(2), pages 268-279, April.
    10. Bretthauer, Kurt M. & Ross, Anthony & Shetty, Bala, 1999. "Nonlinear integer programming for optimal allocation in stratified sampling," European Journal of Operational Research, Elsevier, vol. 116(3), pages 667-680, August.
    11. Michelon, Philippe & Veilleux, Louis, 1996. "Lagrangean methods for the 0-1 Quadratic Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 92(2), pages 326-341, July.
    12. Kurt M. Bretthauer & Bala Shetty, 1995. "The Nonlinear Resource Allocation Problem," Operations Research, INFORMS, vol. 43(4), pages 670-683, August.
    13. Harold P. Benson & S. Selcuk Erenguc, 1990. "An algorithm for concave integer minimization over a polyhedron," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 515-525, August.
    14. Xiang Li & Asgeir Tomasgard & Paul I. Barton, 2011. "Nonconvex Generalized Benders Decomposition for Stochastic Separable Mixed-Integer Nonlinear Programs," Journal of Optimization Theory and Applications, Springer, vol. 151(3), pages 425-454, December.
    15. Sharp, J Frank & Snyder, James C & Greene, James H, 1970. "A Decomposition Algorithm for Solving the Multifacility Production-Transportation Problem with Nonlinear Production Costs," Econometrica, Econometric Society, vol. 38(3), pages 490-506, May.
    16. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.
    17. Richard M. Soland, 1971. "An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints," Management Science, INFORMS, vol. 17(11), pages 759-773, July.
    18. James E. Falk & Richard M. Soland, 1969. "An Algorithm for Separable Nonconvex Programming Problems," Management Science, INFORMS, vol. 15(9), pages 550-569, May.
    19. Peter J. Kolesar, 1967. "A Branch and Bound Algorithm for the Knapsack Problem," Management Science, INFORMS, vol. 13(9), pages 723-735, May.
    20. Gallo, Giorgio & Sandi, Claudio & Sodini, Claudio, 1980. "An algorithm for the min concave cost flow problem," European Journal of Operational Research, Elsevier, vol. 4(4), pages 248-255, April.
    21. Richard M. Soland, 1974. "Optimal Facility Location with Concave Costs," Operations Research, INFORMS, vol. 22(2), pages 373-382, April.
    22. Dijkhuizen, G. & Faigle, U., 1993. "A cutting-plane approach to the edge-weighted maximal clique problem," European Journal of Operational Research, Elsevier, vol. 69(1), pages 121-130, August.
    23. Gabriel R. Bitran & Devanath Tirupati, 1989. "Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks," Operations Research, INFORMS, vol. 37(4), pages 547-564, August.
    24. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    25. Silvano Martello & David Pisinger & Paolo Toth, 1999. "Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem," Management Science, INFORMS, vol. 45(3), pages 414-424, March.
    26. Park, Kyungchul & Lee, Kyungsik & Park, Sungsoo, 1996. "An extended formulation approach to the edge-weighted maximal clique problem," European Journal of Operational Research, Elsevier, vol. 95(3), pages 671-682, December.
    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. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
    3. Harold P. Benson, 1996. "Deterministic algorithms for constrained concave minimization: A unified critical survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 765-795, September.
    4. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    5. Harold P. Benson & S. Selcuk Erenguc, 1990. "An algorithm for concave integer minimization over a polyhedron," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 515-525, August.
    6. Wooseung Jang & J. George Shanthikumar, 2002. "Stochastic allocation of inspection capacity to competitive processes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 78-94, February.
    7. Reiner Horst, 1990. "Deterministic methods in constrained global optimization: Some recent advances and new fields of application," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 433-471, August.
    8. W. David Pisinger & Anders Bo Rasmussen & Rune Sandvik, 2007. "Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 280-290, May.
    9. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    10. Emmanuel Ogbe & Xiang Li, 2019. "A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs," Journal of Global Optimization, Springer, vol. 75(3), pages 595-629, November.
    11. Kurt M. Bretthauer, 1994. "A penalty for concave minimization derived from the tuy cutting plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(3), pages 455-463, April.
    12. Patriksson, Michael & Strömberg, Christoffer, 2015. "Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies," European Journal of Operational Research, Elsevier, vol. 243(3), pages 703-722.
    13. Harold P. Benson, 2004. "Concave envelopes of monomial functions over rectangles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 467-476, June.
    14. Ross, Anthony & Khajehnezhad, Milad & Otieno, Wilkistar & Aydas, Osman, 2017. "Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: A multi-echelon formulation," European Journal of Operational Research, Elsevier, vol. 259(2), pages 664-676.
    15. Alberto Caprara & David Pisinger & Paolo Toth, 1999. "Exact Solution of the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 125-137, May.
    16. Nonas, Sigrid Lise & Thorstenson, Anders, 2000. "A combined cutting-stock and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 327-342, January.
    17. S. Selcuk Erenguc, 1988. "Multiproduct dynamic lot‐sizing model with coordinated replenishments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 1-22, February.
    18. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2020. "A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 747-762, July.
    19. Yanling Chu & Xiaoju Zhang & Zhongzhen Yang, 2017. "Multiple quay cranes scheduling for double cycling in container terminals," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-19, July.
    20. Macambira, Elder Magalhaes & de Souza, Cid Carvalho, 2000. "The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations," European Journal of Operational Research, Elsevier, vol. 123(2), pages 346-371, June.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:iim:iimawp:14658. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.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.