Robust continuous linear programs
DOI10.1007/s11590-020-01539-6zbMath1464.90109OpenAlexW3003369749MaRDI QIDQ2228355
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01539-6
parametric uncertaintyinfinite-dimensional optimizationlinear programming dualitycontinuous linear programming (CLP)probability bound of constraint violationrobust CLP as CLProbust semi-infinite linear programming
Linear programming (90C05) Stochastic programming (90C15) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Existence theories for problems in abstract spaces (49J27) Robustness in mathematical programming (90C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust optimization in countably infinite linear programs
- A simplex based algorithm to solve separated continuous linear programs
- An extended algorithm for separated continuous linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Inexact primal-dual interior point iteration for linear programs in function spaces
- Linear optimal control problems with piecewise analytic solutions
- A class of continuous linear programming problems
- Polynomial Approximations for Continuous Linear Programs
- Theory and Applications of Robust Optimization
- The Price of Robustness
- Some Properties of a Class of Continuous Linear Programs
- A continuous-time network simplex algorithm
- Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- An Algorithm for a Class of Continuous Linear Programs
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- An adaptive discretization algorithm for a class of continuous network programs
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- A Duality Theory for Separated Continuous Linear Programs
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- An Extended Duality Theorem for Continuous Linear Programming Problems
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Numerical solutions to continuous linear programming problems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Bottleneck Problems and Dynamic Programming
This page was built for publication: Robust continuous linear programs
