scientific article; zbMATH DE number 3797486
From MaRDI portal
Publication:4742548
Cited in
(20)- Error bounds for solutions of linear equations and inequalities
- Smoothing methods for convex inequalities and linear complementarity problems
- Error bounds for monotone linear complementarity problems
- Error estimates and Lipschitz constants for best approximation in continuous function spaces
- The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs
- A new simple homotopy algorithm for linear programming. I
- A note of Lipschitz constants for solutions of linear inequalities and equations
- Comments on: Stability in linear optimization and related topics. A personal tour
- The distance to a polyhedron
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Some perturbation theory for linear programming
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Acceptable solutions and backward errors for tensor complementarity problems
- Error bounds for inconsistent linear inequalities and programs
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Linear programming sensitivity measured by the optimal value worst-case analysis
- Sensitivity theorems in integer linear programming
- On the complexity of solving feasible systems of linear inequalities specified with approximate data
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742548)
