Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
From MaRDI portal
Publication:4509734
DOI10.1137/S1052623494278827zbMath0963.90040OpenAlexW2077127687MaRDI QIDQ4509734
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494278827
Related Items (16)
Parametric continuous-time linear fractional programming problems ⋮ Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems ⋮ Inverse conic linear programs in Banach spaces ⋮ Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ Unnamed Item ⋮ Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems ⋮ Using the parametric approach to solve the continuous-time linear fractional Max-min problems ⋮ On solving continuous-time dynamic network flows ⋮ 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 ⋮ Continuous-time linear programming problems revisited: A perturbation approach ⋮ Time-Varying Semidefinite Programs ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions ⋮ Structure of Solutions for Continuous Linear Programs with Constant Coefficients
This page was built for publication: Convergence of a General Class of Algorithms for Separated Continuous Linear Programs