Pages that link to "Item:Q486939"
From MaRDI portal
The following pages link to A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939):
Displaying 4 items.
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem (Q705124) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- Finite iteration method for evaluation of interior point of algebraic polyhedron and bound for step number (Q1380190) (← links)
- A procedure of Chvátal for testing feasibility in linear programming and matrix scaling (Q2496650) (← links)