Bottleneck Problems and Dynamic Programming

DOI10.1073/pnas.39.9.947zbMath0053.27903OpenAlexW2018637736WikidataQ33713921 ScholiaQ33713921MaRDI QIDQ5822348

Richard Bellman

Publication date: 1953

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.39.9.947

zbMATH Keywords

operations research

Related Items (36)

The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming ⋮ Inverse conic linear programs in Banach spaces ⋮ A constant rank constraint qualification in continuous-time nonlinear programming ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ New optimality criteria for convex continuous-time problems of vector optimization ⋮ Continuous-time optimization problems involving invex functions ⋮ Approximate solutions and error bounds for a class of continuous-time linear programming problems ⋮ Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions ⋮ Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ Optimality conditions in a vector continuous-time optimization problem ⋮ Optimality conditions and duality for nonsmooth fractional continuous-time problems ⋮ Duality for nonsmooth continuous-time problems of vector optimization ⋮ Unnamed Item ⋮ Stochastic separated continuous conic programming: strong duality and a solution method ⋮ A simplex based algorithm to solve separated continuous linear programs ⋮ Sufficient Optimality Conditions for Optimal Control Problems with State Constraints ⋮ Unnamed Item ⋮ Robust continuous linear programs ⋮ Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ Continuous-time multiobjective optimization problems via invexity ⋮ Continuous Time Multiobjective Duality Theory ⋮ Continuous-time Programming ⋮ Vector continuous-time programming without differentiability ⋮ A robust optimization approach to dynamic pricing and inventory control with no backorders ⋮ Nonsmooth continuous-time optimization problems: Necessary conditions ⋮ Time-Varying Semidefinite Programs ⋮ Stabilization of a moving object in a neighborhood of an instable equilibrium: some peculiarities of problem statement ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Some results on optimal control with unilateral state constraints ⋮ Some Nonclassical Problems in the Calculus of Variations ⋮ The theory of dynamic programming ⋮ KKT Optimality Conditions and Nonsmooth Continuous Time Optimization Problems ⋮ Structure of Solutions for Continuous Linear Programs with Constant Coefficients ⋮ Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems ⋮ Hardness of approximation for knapsack problems ⋮ Optimality conditions and Lagrangian duality in continuous-time nonlinear programming

This page was built for publication: Bottleneck Problems and Dynamic Programming