Pages that link to "Item:Q1877024"

The following pages link to New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024):

Displaying 3 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) (← links)