Finiteness of the criss-cross algorithm for the linear programming problem with s-monotone index selection rules

DOI10.1515/PUMA-2015-0041OpenAlexW3190867502MaRDI QIDQ5046935FDOQ5046935

Authors: Adrienn Csizmadia 

Publication date: 9 November 2022

Full work available at URL: https://sciendo.com/pdf/10.1515/puma-2015-0041

Recommendations

• On the finiteness of the criss-cross method
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming
• scientific article; zbMATH DE number 3934764
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
• New variants of finite criss-cross pivot algorithms for linear programming

zbMATH Keywords

finitenessindex selectioncriss-cross method

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Cited In (1)

• Finiteness of Criss-Cross Method in Complementarity Problem

This page was built for publication: Finiteness of the criss-cross algorithm for the linear programming problem with s-monotone index selection rules

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