IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i5d10.1007_s10878-023-01054-1.html
   My bibliography  Save this article

Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming

Author

Listed:
  • Meijia Han

    (Fuzhou University)

  • Wenxing Zhu

    (Fuzhou University)

Abstract

The 0-1 linear programming problem with non-negative constraint matrix and objective vector $${\textbf{e}}$$ e origins from many NP-hard combinatorial optimization problems. In this paper, we consider under what condition an optimal solution of the 0-1 problem can be obtained from a weighted linear programming. To this end, we first formulate the 0-1 problem as a sparse minimization problem. Any optimal solution of the 0-1 linear programming problem can be obtained by rounding up an optimal solution of the sparse minimization problem. Then, we establish a condition under which the sparse minimization problem and the weighted linear programming problem have the same optimal solution. The condition is based on the defined non-negative partial s-goodness of the constraint matrix and the weight vector. Further, we use two quantities to characterize a sufficient condition and necessary condition for the non-negative partial s-goodness. However, the two quantities are difficult to calculate, therefore, we provide a computable upper bound for one of the two quantities to verify the non-negative partial s-goodness. Furthermore, we propose two operations of the constraint matrix and weight vector that still preserve non-negative partial s-goodness. Finally, we give some examples to illustrate that our theory is effective and verifiable.

Suggested Citation

  • Meijia Han & Wenxing Zhu, 2023. "Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-37, July.
  • Handle: RePEc:spr:jcomop:v:45:y:2023:i:5:d:10.1007_s10878-023-01054-1
    DOI: 10.1007/s10878-023-01054-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-01054-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-023-01054-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yun-Bin Zhao & Zhi-Quan Luo, 2017. "Constructing New Weighted ℓ 1 -Algorithms for the Sparsest Points of Polyhedral Sets," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 57-76, January.
    2. EDMONDS, Jack & GILES, Rick, 1977. "A min-max relation for submodular functions on graphs," LIDAM Reprints CORE 301, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. R. Chandrasekaran & S. N. Kabadi & R. Sridhar, 1998. "Integer Solution for Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 23(2), pages 390-402, May.
    4. Weili Zhang & Charles D. Nicholson, 2020. "Objective scaling ensemble approach for integer linear programming," Journal of Heuristics, Springer, vol. 26(1), pages 1-19, February.
    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. Hanna Sumita & Naonori Kakimura & Kazuhisa Makino, 2019. "Total dual integrality of the linear complementarity problem," Annals of Operations Research, Springer, vol. 274(1), pages 531-553, March.
    2. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    3. Xujin Chen & Guoli Ding & Xiaodong Hu & Wenan Zang, 2006. "A Min-Max Relation on Packing Feedback Vertex Sets," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 777-788, November.
    4. Alexandre Skoda, 2019. "Convexity of graph-restricted games induced by minimum partitions," Post-Print halshs-01617023, HAL.
    5. Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
    6. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Other publications TiSEM b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
    7. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    8. Alexandre Skoda, 2017. "Inheritance of Convexity for the P min-Restricted Game," Post-Print halshs-01660670, HAL.
    9. Hanna Sumita & Naonori Kakimura & Kazuhisa Makino, 2015. "The Linear Complementarity Problems with a Few Variables per Constraint," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 1015-1026, October.
    10. Alexander Bockmayr & Friedrich Eisenbrand, 2001. "Cutting Planes and the Elementary Closure in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 304-312, May.
    11. Alexandre Skoda, 2016. "Complexity of inheritance of F-convexity for restricted games induced by minimum partitions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01382502, HAL.
    12. Zukui Li & Marianthi Ierapetritou, 2010. "A method for solving the general parametric linear complementarity problem," Annals of Operations Research, Springer, vol. 181(1), pages 485-501, December.
    13. Xujin Chen & Guoli Ding & Wenan Zang, 2008. "A Characterization of Box-Mengerian Matroid Ports," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 497-512, May.
    14. Alexandre Skoda, 2016. "Complexity of inheritance of F-convexity for restricted games induced by minimum partitions," Post-Print halshs-01382502, HAL.
    15. Guoli Ding & Lei Tan & Wenan Zang, 2018. "When Is the Matching Polytope Box-Totally Dual Integral?," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 64-99, February.
    16. Kristóf Bérczi & András Frank, 2018. "Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 726-753, August.
    17. Qin Chen & Xujin Chen, 2012. "Packing cycles exactly in polynomial time," Journal of Combinatorial Optimization, Springer, vol. 23(2), pages 167-188, February.
    18. Alexandre Skoda, 2017. "Inheritance of Convexity for the Pmin-Restricted Game," Documents de travail du Centre d'Economie de la Sorbonne 17051, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    19. Zaifu Yang, 2008. "On the Solutions of Discrete Nonlinear Complementarity and Related Problems," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 976-990, November.
    20. Qin Chen & Xujin Chen & Wenan Zang, 2016. "A Polyhedral Description of Kernels," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 969-990, August.

    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:spr:jcomop:v:45:y:2023:i:5:d:10.1007_s10878-023-01054-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.