The following pages link to (Q3823406):
Displaying 7 items.
- A quadratically convergent method for linear programming (Q808185) (← links)
- Comparison between Baumann and admissible simplex forms in interval analysis (Q995937) (← links)
- A barrier method for dynamic Leontief-type linear programs (Q1199511) (← links)
- A linear and discrete programming framework for representing qualitative knowledge (Q1309850) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Some notes on the nonlinear simplex method (Q2772280) (← links)
- A Comparison of the Original and Revised Simplex Methods (Q5378744) (← links)