The following pages link to (Q4742548):
Displayed 15 items.
- A new simple homotopy algorithm for linear programming. I (Q1102185) (← links)
- The distance to a polyhedron (Q1187387) (← links)
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program (Q1260956) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Some perturbation theory for linear programming (Q1334953) (← links)
- Error bounds for analytic systems and their applications (Q1340064) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805) (← links)
- A note of Lipschitz constants for solutions of linear inequalities and equations (Q1923226) (← links)
- Smoothing methods for convex inequalities and linear complementarity problems (Q1924058) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Error bounds for monotone linear complementarity problems (Q4721881) (← links)
- Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)