IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v21y1973i1p353-359.html
   My bibliography  Save this article

Technical Note—The Use of Cuts in Complementary Programming

Author

Listed:
  • Toshihide Ibaraki

    (Kyoto University, Kyoto, Japan)

Abstract

A complementary programming problem is a linear programming problem with the additional restriction that x p x q = 0 holds for each specified pair ( x p , x q ). This paper obtains constraints called C-cuts from the restriction x p x q = 0, and uses them to facilitate the computation of the branch-and-bound procedure proposed in an earlier paper [ Opns. Res. 19, 1523–1528 (1971)]. Some computational results are also reported.

Suggested Citation

  • Toshihide Ibaraki, 1973. "Technical Note—The Use of Cuts in Complementary Programming," Operations Research, INFORMS, vol. 21(1), pages 353-359, February.
    • Handle: RePEc:inm:oropre:v:21:y:1973:i:1:p:353-359
    DOI: 10.1287/opre.21.1.353
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.21.1.353
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.21.1.353?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
    ---><---

    Citations

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


    Cited by:

    1. Alberto Pia & Jeff Linderoth & Haoran Zhu, 2024. "Relaxations and cutting planes for linear programs with complementarity constraints," Journal of Global Optimization, Springer, vol. 90(1), pages 27-51, September.
    2. Francisco Jara-Moroni & John E. Mitchell & Jong-Shi Pang & Andreas Wächter, 2020. "An enhanced logical benders approach for linear programs with complementarity constraints," Journal of Global Optimization, Springer, vol. 77(4), pages 687-714, August.
    3. Trang T. Nguyen & Jean-Philippe P. Richard & Mohit Tawarmalani, 2021. "Convexification techniques for linear complementarity constraints," Journal of Global Optimization, Springer, vol. 80(2), pages 249-286, June.

    More about this item

    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:oropre:v:21:y:1973:i:1:p:353-359. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.