IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v100y2021ics0305048320307088.html
   My bibliography  Save this article

The row pivoting method for linear programming

Author

Listed:
  • Liu, Yanwu
  • Tu, Yan
  • Zhang, Zhongzhen

Abstract

Solving linear programming is essentially to solve a special system of linear inequalities. Unlike other pivoting methods, we find that row geometry can fully and effectively exploit huge potential of Farkas Lemma in solving systems of linear inequalities and is a feasible way to solve linear programming. Therefore, we develop the row pivoting method for solving linear programming. The central idea of this method is to solve a system of linear inequalities corresponding to constraints of linear programming while keeping the optimality condition true all the time. In the proposed method, any linear programming problem can be solved without imposing redundancy or consistency assumptions, equations and inequalities in the constraints can be directly expressed in row vector form free of any auxiliary variables. The method can identify inconsistency and redundancy of constraints inherently, start with an arbitrary basic solution directly, eliminate equation constraints efficiently, and treat lower and upper bounds on any inequality constraint simultaneously. The proof of existence and convergence guarantees that the method can determine whether there exists an optimal solution to linear programming in finitely many steps.

Suggested Citation

  • Liu, Yanwu & Tu, Yan & Zhang, Zhongzhen, 2021. "The row pivoting method for linear programming," Omega, Elsevier, vol. 100(C).
    • Handle: RePEc:eee:jomega:v:100:y:2021:i:c:s0305048320307088
    DOI: 10.1016/j.omega.2020.102354
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048320307088
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2020.102354?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. Arsham, Hossein & Adlakha, Veena & Lev, Benjamin, 2009. "A simplified algebraic method for system of linear inequalities with LP applications," Omega, Elsevier, vol. 37(4), pages 876-882, August.
    2. Irvin J. Lustig & Roy E. Marsten & David F. Shanno, 1994. "Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art," INFORMS Journal on Computing, INFORMS, vol. 6(1), pages 1-14, February.
    3. Richard W. Cottle, 2005. "George B. Dantzig: Operations Research Icon," Operations Research, INFORMS, vol. 53(6), pages 892-898, December.
    4. Robert G. Bland, 1977. "New Finite Pivoting Rules for the Simplex Method," Mathematics of Operations Research, INFORMS, vol. 2(2), pages 103-107, May.
    5. Erling D. Andersen & Yinyu Ye, 1996. "Combining Interior-Point and Pivoting Algorithms for Linear Programming," Management Science, INFORMS, vol. 42(12), pages 1719-1731, December.
    6. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    7. Robert E. Bixby, 2002. "Solving Real-World Linear Programs: A Decade and More of Progress," Operations Research, INFORMS, vol. 50(1), pages 3-15, February.
    8. Jan Telgen, 1983. "Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints," Management Science, INFORMS, vol. 29(10), pages 1209-1222, October.
    9. Dalalah, Doraid & Lev, Benjamin, 2009. "Duality of the improved algebraic method (DIAM)," Omega, Elsevier, vol. 37(5), pages 1027-1035, October.
    10. Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
    11. Illes, Tibor & Terlaky, Tamas, 2002. "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, Elsevier, vol. 140(2), pages 170-190, July.
    12. BLAND, Robert G., 1977. "New finite pivoting rules for the simplex method," LIDAM Reprints CORE 315, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. T. H. Mattheiss, 1973. "An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities," Operations Research, INFORMS, vol. 21(1), pages 247-260, February.
    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. Erdmann, Melinda & Pietrzyk, Irena Magdalena & Schneider, Juliana & Helbig, Marcel & Jacob, Marita & Allmendinger, Jutta, 2022. "Bildungsungleichheit nach der Hochschulreife - das lässt sich ändern: Eine Untersuchung der Wirksamkeit eines intensiven Beratungsprogramms 1,5 Jahre nach dem Abitur," Discussion Papers, Presidential Department P 2022-002, WZB Berlin Social Science Center.

    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. Fabio Vitor & Todd Easton, 2018. "The double pivot simplex method," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 109-137, February.
    2. Csizmadia, Zsolt & Illés, Tibor & Nagy, Adrienn, 2012. "The s-monotone index selection rules for pivot algorithms of linear programming," European Journal of Operational Research, Elsevier, vol. 221(3), pages 491-500.
    3. Adrienn Csizmadia & Zsolt Csizmadia & Tibor Illés, 2018. "Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 535-550, September.
    4. Im, Haesol & Wolkowicz, Henry, 2023. "Revisiting degeneracy, strict feasibility, stability, in linear programming," European Journal of Operational Research, Elsevier, vol. 310(2), pages 495-510.
    5. Konstantinos Paparrizos & Nikolaos Samaras & Angelo Sifaleras, 2015. "Exterior point simplex-type algorithms for linear and network optimization problems," Annals of Operations Research, Springer, vol. 229(1), pages 607-633, June.
    6. Erling D. Andersen, 1999. "On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 95-103, February.
    7. Yiran Cui & Keiichi Morikuni & Takashi Tsuchiya & Ken Hayami, 2019. "Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning," Computational Optimization and Applications, Springer, vol. 74(1), pages 143-176, September.
    8. Omer, Jérémy & Soumis, François, 2015. "A linear programming decomposition focusing on the span of the nondegenerate columns," European Journal of Operational Research, Elsevier, vol. 245(2), pages 371-383.
    9. Jeffery L. Kennington & Karen R. Lewis, 2004. "Generalized Networks: The Theory of Preprocessing and an Empirical Analysis," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 162-173, May.
    10. Filippi, Carlo & Romanin-Jacur, Giorgio, 2002. "Multiparametric demand transportation problem," European Journal of Operational Research, Elsevier, vol. 139(2), pages 206-219, June.
    11. Silvia Araújo dos Reis & José Eugenio Leal & Antônio Márcio Tavares Thomé, 2023. "A Two-Stage Stochastic Linear Programming Model for Tactical Planning in the Soybean Supply Chain," Logistics, MDPI, vol. 7(3), pages 1-26, August.
    12. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Other publications TiSEM b25faf5d-0142-4e14-b598-a, Tilburg University, School of Economics and Management.
    13. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
    14. Jean Bertrand Gauthier & Jacques Desrosiers & Marco E. Lübbecke, 2016. "Tools for primal degenerate linear programs: IPS, DCA, and PE," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(2), pages 161-204, June.
    15. Maria Gonzalez-Lima & Hua Wei & Henry Wolkowicz, 2009. "A stable primal–dual approach for linear programming under nondegeneracy assumptions," Computational Optimization and Applications, Springer, vol. 44(2), pages 213-247, November.
    16. Pan, Ping-Qi, 2008. "A largest-distance pivot rule for the simplex algorithm," European Journal of Operational Research, Elsevier, vol. 187(2), pages 393-402, June.
    17. Magnanti, Thomas L. & Orlin, James B., 1953-., 1985. "Parametric linear programming and anti-cycling pivoting rules," Working papers 1730-85., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    18. Michael J. Best & Xili Zhang, 2011. "Degeneracy Resolution for Bilinear Utility Functions," Journal of Optimization Theory and Applications, Springer, vol. 150(3), pages 615-634, September.
    19. K. O. Kortanek & Zhu Jishan, 1988. "New purification algorithms for linear programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 571-583, August.
    20. Fabio Vitor & Todd Easton, 2022. "Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming," Computational Optimization and Applications, Springer, vol. 83(1), pages 211-246, September.

    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:eee:jomega:v:100:y:2021:i:c:s0305048320307088. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.