A Study of General Dynamic Network Programs with Arc Time-Delays

DOI10.1137/S1052623495288180zbMath0891.90163OpenAlexW2060451040MaRDI QIDQ4376152

Malcolm C. Pullan

Publication date: 10 February 1998

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623495288180

zbMATH Keywords

dualitydynamic network flowscontinuous linear programminglinear optimal control

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Duality theory (optimization) (49N15) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Linear optimal control problems (49N05) Numerical methods in optimal control (49M99)

Related Items (6)

On solving continuous-time dynamic network flows ⋮ Unnamed Item ⋮ Stochastic separated continuous conic programming: strong duality and a solution method ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Efficient continuous-time dynamic network flow algorithms

This page was built for publication: A Study of General Dynamic Network Programs with Arc Time-Delays