On the Number of Pivots of Dantzig’s Simplex Methods for Linear and Convex Quadratic Programs

  • Shaoning Han
    • Categories Complementarity and Variational Inequalities, Linear Programming, Quadratic Programming Tags , , , , , Short URL: https://optimization-online.org/?p=22924

    Refining and extending works by Ye and Kitahara-Mizuno, this paper presents new results on the number of pivots of simplex-type methods for solving linear programs of the Leontief kind, certain linear complementarity problems of the P kind, and nonnegative constrained convex quadratic programs. Our results contribute to the further understanding of the complexity and efficiency of simplex-type methods for solving these problems.

    Article

    Download

    View On the Number of Pivots of Dantzig’s Simplex Methods for Linear and Convex Quadratic Programs