Bottleneck Problems and Dynamic Programming

DOI10.1073/PNAS.39.9.947zbMATH Open0053.27903OpenAlexW2018637736WikidataQ33713921 ScholiaQ33713921MaRDI QIDQ5822348FDOQ5822348

Authors: 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

Cited In (38)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5822348)