Pages that link to "Item:Q1827666"
From MaRDI portal
The following pages link to A note on two direct methods in linear programming (Q1827666):
Displaying 4 items.
- Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
- On simplex method with most-obtuse-angle rule and cosine rule (Q548344) (← links)
- A new least square algorithm for linear programming (Q2505271) (← links)
- Two direct methods in linear programming (Q5935423) (← links)