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

Tools

Illes, Tibor and Nagy, Adrienn (2014) Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied. ELTE/BME. (http://www.cs.elte.hu/opres/orr/download/ORR14_01....)

Full text not available in this repository.Request a copy

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.

ORCID iDs

Illes, Tibor ORCID logoORCID: https://orcid.org/0000-0002-5396-3148 and Nagy, Adrienn;
CORE (COnnecting REpositories)