Mathematical Programming and the Maximum Transform

DOI10.1137/0110042zbMath0106.14002OpenAlexW2093626764MaRDI QIDQ3292039

Richard Bellman, W. Karush

Publication date: 1962

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

applications of probability theory, mathematical programming

Related Items (15)

Sequential minimaxization under dynamic programming structure ⋮ Total Variation on a Tree ⋮ Conjugate transforms for \(\tau_T\) semigroups of probability distribution functions ⋮ A polyhedral perspective on tropical convolutions ⋮ Iterative integral versus dynamic programming ⋮ Necklaces, convolutions, and \(X+Y\) ⋮ The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions ⋮ Computational experiments with a class of dynamic programming algorithms of higher dimensions ⋮ Conjugate duality and its implications in dynamic programming ⋮ Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time ⋮ Computation of optimal controls ⋮ Profit functions and optimal control: An alternate description of the control problem ⋮ The law of large numbers for fuzzy variables under a general triangular norm extension principle ⋮ On information functions and their polars ⋮ Conjugate duality and the curse of dimensionality

This page was built for publication: Mathematical Programming and the Maximum Transform