Pages that link to "Item:Q1103522"
From MaRDI portal
The following pages link to Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value (Q1103522):
Displaying 12 items.
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- An \(\epsilon\)-active barrier-function method for solving minimax problems (Q806678) (← links)
- Asymptotic behaviour of Karmarkar's method for linear programming (Q911987) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- A barrier function method for minimax problems (Q1186276) (← links)
- A relaxed primal-dual path-following algorithm for linear programming (Q1915911) (← links)
- A variation on Karmarkar’s algorithm for solving linear programming problems (Q3030578) (← links)
- A modified scaling algorithm for LP (Q3352838) (← links)
- El metodo de Karmarkar: Un estudio de sus variantes (Q3360002) (← links)