IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i6p1579-1610.html
   My bibliography  Save this article

Computing Optimality Certificates for Convex Mixed-Integer Nonlinear Problems

Author

Listed:
  • Katrin Halbig

    (Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany)

  • Lukas Hümbs

    (Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany)

  • Florian Rösel

    (Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany)

  • Lars Schewe

    (School of Mathematics and Maxwell Institute for Mathematical Sciences, University of Edinburgh, Edinburgh EH9 3FD, United Kingdom)

  • Dieter Weninger

    (Department of Data Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, 91058 Erlangen, Germany)

Abstract

Every optimization problem has a corresponding verification problem that checks whether a given optimal solution is in fact optimal. In the literature, there are a lot of such ways to verify optimality for a given solution, for example, the branch-and-bound tree. To simplify this task, optimality certificates were introduced for convex mixed-integer nonlinear programs, and it was shown that the sizes of the certificates are bounded in terms of the number of integer variables. We introduce an algorithm to compute the certificates and conduct computational experiments. Through the experiments, we show that the optimality certificates can be surprisingly small.

Suggested Citation

  • Katrin Halbig & Lukas Hümbs & Florian Rösel & Lars Schewe & Dieter Weninger, 2024. "Computing Optimality Certificates for Convex Mixed-Integer Nonlinear Problems," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1579-1610, December.
    • Handle: RePEc:inm:orijoc:v:36:y:2024:i:6:p:1579-1610
    DOI: 10.1287/ijoc.2022.0099
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2022.0099
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2022.0099?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. Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
    2. Björn Geißler & Antonio Morsi & Lars Schewe & Martin Schmidt, 2018. "Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 309-323, May.
    3. Mark S. Daskin & Kayse Lee Maass, 2015. "The p-Median Problem," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 21-45, Springer.
    4. Bikhchandani, Sushil & Mamer, John W., 1997. "Competitive Equilibrium in an Exchange Economy with Indivisibilities," Journal of Economic Theory, Elsevier, vol. 74(2), pages 385-413, June.
    5. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    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. Proano, Ruben A. & Jacobson, Sheldon H. & Zhang, Wenbo, 2012. "Making combination vaccines more accessible to low-income countries: The antigen bundle pricing problem," Omega, Elsevier, vol. 40(1), pages 53-64, January.
    2. Arribas, I. & Urbano, A., 2017. "Multiproduct trading with a common agent under complete information: Existence and characterization of Nash equilibrium," Journal of Economic Theory, Elsevier, vol. 167(C), pages 14-38.
    3. Lukas Hümbs & Alexander Martin & Lars Schewe, 2022. "Exploiting complete linear descriptions for decentralized power market problems with integralities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(3), pages 451-474, June.
    4. Martin Bichler & Johannes Knörr & Felipe Maldonado, 2023. "Pricing in Nonconvex Markets: How to Price Electricity in the Presence of Demand Response," Information Systems Research, INFORMS, vol. 34(2), pages 652-675, June.
    5. Arribas, Ivan & Urbano, Amparo, 2005. "Nash equilibria in a model of multiproduct price competition: an assignment problem," Journal of Mathematical Economics, Elsevier, vol. 41(3), pages 351-385, April.
    6. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    7. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    8. Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013. "Stability and fairness in models with a multiple membership," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.
    9. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
    10. Ravi Bapna & Paulo Goes & Alok Gupta, 2005. "Pricing and Allocation for Quality-Differentiated Online Services," Management Science, INFORMS, vol. 51(7), pages 1141-1150, July.
    11. Lahiri, Somdeb, 2008. "Envy-free solutions, Non-linear equilibrium and Egalitarian-equivalence for the Package Assignment Problem," MPRA Paper 8444, University Library of Munich, Germany.
    12. Vohra, Rakesh V., 2015. "Combinatorial Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    13. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    14. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    15. Ilya Segal, 2004. "The Communication Requirements of of Social Choice Rules and Supporting Budget Sets," Economics Working Papers 0039, Institute for Advanced Study, School of Social Science.
    16. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    17. Ivan Arribas & Amparo Urbano, 2004. "Mixed Bundling Strategies And Multiproduct Price Competition," Working Papers. Serie AD 2004-01, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
    18. Bichler, Martin & Knörr, Johannes, 2023. "Getting prices right on electricity spot markets: On the economic impact of advanced power flow models," Energy Economics, Elsevier, vol. 126(C).
    19. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    20. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:inm:orijoc:v:36:y:2024:i:6:p:1579-1610. 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.