Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied

Tibor Illes, Adrienn Nagy

Research output: Book/ReportOther report

Abstract

This paper considers the primal simplex method for linearly constrained convex quadratic programming problems. Finiteness of the algorithm is proven when s-monotone index selection rules are applied. The proof is rather general: it shows that any index selection rule that only relies on the sign structure of the reduced costs / transformed right hand side vector and for which the traditional primal simplex method is finite is necessarily finite as well for the primal simplex method for linearly constrained convex quadratic programming problems.
Original languageEnglish
Number of pages26
Volume2014
Publication statusPublished - 20 May 2014

Publication series

NameOperations Research Report
PublisherELTE
ISSN (Print)1215-5918

    Fingerprint

Keywords

  • quadratic programming
  • finiteness of algorithms
  • algorithms
  • primal simplex method

Cite this