Finiteness of the quadratic simplex method with the application of index selection rules

MaRDI QIDQ2834253zbMATH OpenFDO

Authors Adrienn Nagy, Tibor Illés

Publication date 25 November 2016

Published in Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei (Search for Journal in Brave)

zbMATH Keywords

index selectionprimal simplexquadratic simplex

Mathematics Subject Classification ID

Linear programming (90C05) Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
• New variants of the criss-cross method for linearly constrained convex quadratic programming
• Practical finite pivoting rules for the simplex method
• scientific article; zbMATH DE number 4045475
• A new proof for the criss-cross method for quadratic programming

Cited in

(1)

• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied

This page was built for publication: Finiteness of the quadratic simplex method with the application of index selection rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834253)