IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/16.html
   My bibliography  Save this paper

Row Dropping Procedures for Cutting Plane Algorithms

Author

Listed:
  • Frederic H. Murphy

Abstract

No abstract is available for this item.

Suggested Citation

  • Frederic H. Murphy, 1972. "Row Dropping Procedures for Cutting Plane Algorithms," Discussion Papers 16, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    • Handle: RePEc:nwu:cmsems:16
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/16.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Arthur F. Veinott, 1967. "The Supporting Hyperplane Method for Unimodal Programming," Operations Research, INFORMS, vol. 15(1), pages 147-152, February.
    2. Donald M. Topkis, 1970. "Cutting-Plane Methods without Nested Constraint Sets," Operations Research, INFORMS, vol. 18(3), pages 404-413, June.
    3. A. J. Hoffman & R. M. Karp, 1966. "On Nonterminating Stochastic Games," Management Science, INFORMS, vol. 12(5), pages 359-370, January.
    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. Valerian Bulatov, 2010. "Methods of embedding-cutting off in problems of mathematical programming," Journal of Global Optimization, Springer, vol. 48(1), pages 3-15, September.
    2. Jayakumar Subramanian & Amit Sinha & Aditya Mahajan, 2023. "Robustness and Sample Complexity of Model-Based MARL for General-Sum Markov Games," Dynamic Games and Applications, Springer, vol. 13(1), pages 56-88, March.
    3. Felipe Serrano & Robert Schwarz & Ambros Gleixner, 2020. "On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm," Journal of Global Optimization, Springer, vol. 78(1), pages 161-179, September.
    4. Alfred Auslender & Miguel A. Goberna & Marco A. López, 2009. "Penalty and Smoothing Methods for Convex Semi-Infinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 303-319, May.
    5. Tapio Westerlund & Ville-Pekka Eronen & Marko M. Mäkelä, 2018. "On solving generalized convex MINLP problems using supporting hyperplane techniques," Journal of Global Optimization, Springer, vol. 71(4), pages 987-1011, August.
    6. Ville-Pekka Eronen & Jan Kronqvist & Tapio Westerlund & Marko M. Mäkelä & Napsu Karmitsa, 2017. "Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems," Journal of Global Optimization, Springer, vol. 69(2), pages 443-459, October.
    7. H. P. Benson, 2010. "Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 1-18, July.
    8. Johannes Horner & Satoru Takahashi & Nicolas Vieille, 2012. "On the Limit Equilibrium Payoff Set in Repeated and Stochastic Games," Cowles Foundation Discussion Papers 1848, Cowles Foundation for Research in Economics, Yale University.
    9. Daniel Dörfler, 2022. "On the Approximation of Unbounded Convex Sets by Polyhedra," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 265-287, July.
    10. Krishnendu Chatterjee & Rupak Majumdar & Thomas Henzinger, 2008. "Stochastic limit-average games are in EXPTIME," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 219-234, June.
    11. Wim Ackooij & Welington Oliveira, 2014. "Level bundle methods for constrained convex optimization with various oracles," Computational Optimization and Applications, Springer, vol. 57(3), pages 555-597, April.
    12. Johannes Horner & Takuo Sugaya & Satoru Takahashi & Nicolas Vieille, 2009. "Recursive Methods in Discounted Stochastic Games: An Algorithm for delta Approaching 1 and a Folk Theorem," Cowles Foundation Discussion Papers 1742, Cowles Foundation for Research in Economics, Yale University, revised Aug 2010.
    13. Chunming Tang & Bo He & Zhenzhen Wang, 2020. "Modified Accelerated Bundle-Level Methods and Their Application in Two-Stage Stochastic Programming," Mathematics, MDPI, vol. 8(2), pages 1-26, February.
    14. Pey-Chun Chen & Pierre Hansen & Brigitte Jaumard & Hoang Tuy, 1998. "Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming," Operations Research, INFORMS, vol. 46(4), pages 548-562, August.
    15. Wendel Melo & Marcia Fampa & Fernanda Raupp, 2020. "An overview of MINLP algorithms and their implementation in Muriqui Optimizer," Annals of Operations Research, Springer, vol. 286(1), pages 217-241, March.
    16. Endre Boros & Khaled Elbassioni & Vladimir Gurvich & Kazuhisa Makino, 2013. "On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games," Dynamic Games and Applications, Springer, vol. 3(2), pages 128-161, June.
    17. Endre Boros & Khaled Elbassioni & Vladimir Gurvich & Kazuhisa Makino, 2018. "A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games," Dynamic Games and Applications, Springer, vol. 8(1), pages 22-41, March.
    18. Wim Ackooij, 2014. "Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(3), pages 227-253, December.
    19. Hörner, Johannes & Takahashi, Satoru & Vieille, Nicolas, 2014. "On the limit perfect public equilibrium payoff set in repeated and stochastic games," Games and Economic Behavior, Elsevier, vol. 85(C), pages 70-83.
    20. S. K. Neogy & Prasenjit Mondal & Abhijit Gupta & Debasish Ghorui, 2018. "On Solving Mean Payoff Games Using Pivoting Algorithms," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-26, October.

    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:nwu:cmsems:16. 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: Fran Walker (email available below). General contact details of provider: https://edirc.repec.org/data/cmnwuus.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.