Rigorous Lower and Upper Bounds in Linear Programming
From MaRDI portal
Recommendations
- Rigorous solution of linear programming problems with uncertain data
- A review of computation of mathematically rigorous bounds on optima of linear programs
- scientific article; zbMATH DE number 4158371
- A rigorous lower bound for the optimal value of convex optimization problems
- scientific article; zbMATH DE number 4068181
Cited in
(19)- Calculating the exact bounds of optimal values in LP with interval coefficients
- Lower bound functions for polynomials
- A rigorous lower bound for the optimal value of convex optimization problems
- On strong optimality of interval linear programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Exact solutions to linear programming problems
- Computational experience with rigorous error bounds for the Netlib linear programming library
- Iterative refinement for linear programming
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- scientific article; zbMATH DE number 4068181 (Why is no real title available?)
- Rigorous solution of linear programming problems with uncertain data
- A reliable affine relaxation method for global optimization
- Maximal inner boxes in parametric \textit{AE}-solution sets with linear shape
- Hybridizing two linear relaxation techniques in interval-based solvers
- Bounds on the worst optimal value in interval linear programming
- On verified numerical computations in convex programming
- A characterization of Delsarte's linear programming bound as a ratio bound
This page was built for publication: Rigorous Lower and Upper Bounds in Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651975)
