An Algorithm for a Class of Continuous Linear Programs
From MaRDI portal
Publication:4277528
DOI10.1137/0331073zbMath0833.90124OpenAlexW2089967443MaRDI QIDQ4277528
Publication date: 15 February 1996
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0331073
discrete approximationstrong duality resultseparated continuous linear programsSCLPsimplex like algorithm
Linear programming (90C05) Programming in abstract spaces (90C48) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Related Items (40)
Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. ⋮ 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 ⋮ A constant rank constraint qualification in continuous-time nonlinear programming ⋮ Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ MINIMIZING MAKESPAN IN A MULTICLASS FLUID NETWORK WITH PARAMETER UNCERTAINTY ⋮ Unnamed Item ⋮ The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization ⋮ Continuous-time optimization problems involving invex functions ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions ⋮ 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 ⋮ Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems ⋮ A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems ⋮ Using the parametric approach to solve the continuous-time linear fractional Max-min problems ⋮ On solving continuous-time dynamic network flows ⋮ Unnamed Item ⋮ 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 ⋮ The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems ⋮ Continuous-time multiobjective optimization problems via invexity ⋮ Toward an integrated workforce planning framework using structured equations ⋮ Continuous-time linear programming problems revisited: A perturbation approach ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Determining strategy of pricing for a web service with different QoS levels and reservation level constraint ⋮ A robust optimization approach to dynamic pricing and inventory control with no backorders ⋮ Nonsmooth continuous-time optimization problems: Necessary conditions ⋮ Time-Varying Semidefinite Programs ⋮ A Discounted-Cost Continuous-Time Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ A simplex algorithm for minimum-cost network-flow problems in infinite networks ⋮ Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions ⋮ Structure of Solutions for Continuous Linear Programs with Constant Coefficients ⋮ Solving the drift control problem ⋮ Efficient continuous-time dynamic network flow algorithms
This page was built for publication: An Algorithm for a Class of Continuous Linear Programs
