IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/876ff1ab-036c-4635-9688-11084a7cfb50.html
   My bibliography  Save this paper

An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix

Author

Listed:
  • Badenbroek, Riley

    (Tilburg University, School of Economics and Management)

  • de Klerk, Etienne

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • Badenbroek, Riley & de Klerk, Etienne, 2020. "An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix," Other publications TiSEM 876ff1ab-036c-4635-9688-1, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:876ff1ab-036c-4635-9688-11084a7cfb50
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/41209489/2006.05319.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Qingxia Kong & Chung-Yee Lee & Chung-Piaw Teo & Zhichao Zheng, 2013. "Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones," Operations Research, INFORMS, vol. 61(3), pages 711-726, June.
    2. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    3. Veit Elser, 2017. "Matrix product constraints by projection methods," Journal of Global Optimization, Springer, vol. 68(2), pages 329-355, June.
    4. Karthik Natarajan & Chung Piaw Teo & Zhichao Zheng, 2011. "Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation," Operations Research, INFORMS, vol. 59(3), pages 713-728, June.
    5. Peter Dickinson & Luuk Gijben, 2014. "On the computational complexity of membership problems for the completely positive cone and its dual," Computational Optimization and Applications, Springer, vol. 57(2), pages 403-415, March.
    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. Badenbroek, Riley, 2021. "Interior point methods and simulated annealing for nonsymmetric conic optimization," Other publications TiSEM 4374ab25-fdb5-4e6e-a198-6, Tilburg University, School of Economics and Management.

    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. Badenbroek, Riley & de Klerk, Etienne, 2022. "An analytic center cutting plane method to determine complete positivity of a matrix," Other publications TiSEM 088da653-b943-4ed0-9720-6, Tilburg University, School of Economics and Management.
    2. Riley Badenbroek & Etienne de Klerk, 2022. "An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1115-1125, March.
    3. Areesh Mittal & Can Gokalp & Grani A. Hanasusanto, 2020. "Robust Quadratic Programming with Mixed-Integer Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 201-218, April.
    4. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    5. Qingxia Kong & Shan Li & Nan Liu & Chung-Piaw Teo & Zhenzhen Yan, 2020. "Appointment Scheduling Under Time-Dependent Patient No-Show Behavior," Management Science, INFORMS, vol. 66(8), pages 3480-3500, August.
    6. Zhang, Abraham & Zheng, Zhichao & Teo, Chung-Piaw, 2022. "Schedule reliability in liner shipping timetable design: A convex programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 499-525.
    7. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    8. Immanuel M. Bomze & Vaithilingam Jeyakumar & Guoyin Li, 2018. "Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations," Journal of Global Optimization, Springer, vol. 71(3), pages 551-569, July.
    9. Bomze, Immanuel M. & Gabl, Markus, 2023. "Optimization under uncertainty and risk: Quadratic and copositive approaches," European Journal of Operational Research, Elsevier, vol. 310(2), pages 449-476.
    10. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    11. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    12. Long He & Ho-Yin Mak & Ying Rong & Zuo-Jun Max Shen, 2017. "Service Region Design for Urban Electric Vehicle Sharing Systems," Manufacturing & Service Operations Management, INFORMS, vol. 19(2), pages 309-327, May.
    13. Zhichao Zheng & Karthik Natarajan & Chung-Piaw Teo, 2016. "Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty," Operations Research, INFORMS, vol. 64(6), pages 1406-1421, December.
    14. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    15. Zhenzhen Yan & Sarah Yini Gao & Chung Piaw Teo, 2018. "On the Design of Sparse but Efficient Structures in Operations," Management Science, INFORMS, vol. 64(7), pages 3421-3445, July.
    16. Jinyan Fan & Jiawang Nie & Anwa Zhou, 2019. "Completely Positive Binary Tensors," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1087-1100, August.
    17. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
    18. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2019. "Dynamic job assignment: A column generation approach with an application to surgery allocation," European Journal of Operational Research, Elsevier, vol. 272(1), pages 78-93.
    19. Shan Wang & Nan Liu & Guohua Wan, 2020. "Managing Appointment-Based Services in the Presence of Walk-in Customers," Management Science, INFORMS, vol. 66(2), pages 667-686, February.
    20. Shenghai Zhou & Yichuan Ding & Woonghee Tim Huh & Guohua Wan, 2021. "Constant Job‐Allowance Policies for Appointment Scheduling: Performance Bounds and Numerical Analysis," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2211-2231, July.

    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:tiu:tiutis:876ff1ab-036c-4635-9688-11084a7cfb50. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.