A New Algorithm for State-Constrained Separated Continuous Linear Programs
From MaRDI portal
Publication:4237218
DOI10.1137/S0363012995292664zbMath0921.49023OpenAlexW1991386000MaRDI QIDQ4237218
Xiao-Dong Luo, Dimitris J. Bertsimas
Publication date: 31 March 1999
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012995292664
nonlinear programmingstrong dualitysemi-infinite linear programmingcontinuous linear programmingjobshop scheduling problems
Linear programming (90C05) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Related Items
Asymptotic optimality of tracking policies in stochastic networks. ⋮ Inverse conic linear programs in Banach spaces ⋮ Fluid analysis of an input control problem ⋮ The Lagrange approach to infinite linear programs ⋮ Unnamed Item ⋮ Optimal control of a two-server flow-shop network ⋮ A robust optimization formulation for dynamic pricing of a web service with limited total shared capacity ⋮ A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems ⋮ On solving continuous-time dynamic network flows ⋮ Global optimization in Hilbert space ⋮ Stochastic separated continuous conic programming: strong duality and a solution method ⋮ A simplex based algorithm to solve separated continuous linear programs ⋮ Robust continuous linear programs ⋮ Optimal control with monotonicity constraints for a parallel-server loss channel serving multi-class jobs ⋮ Determining strategy of pricing for a web service with different QoS levels and reservation level constraint ⋮ Time-Varying Semidefinite Programs ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Boundary-influenced robust controls: two network examples ⋮ Linear semi-infinite programming theory: an updated survey
