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 2 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices (Q5478870) (← links)