On a class of convex allocation problems

DOI10.1016/0022-247X(69)90224-8zbMath0191.49301OpenAlexW1996572461MaRDI QIDQ2538065

J. R. Bagwell, C. S. Beightler, J. P. W. Stark

Publication date: 1969

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(69)90224-8

zbMATH Keywords

operations research

Related Items (3)

Approximating closed form solutions to converging branch dynamic programming problems ⋮ Closed form solutions to nonserial, nonconvex quadratic programming problems using dynamic programming ⋮ A maximum principle for infinite-stage optimal control processes

Cites Work

• Dynamic Programming and "Difficult Crossing" Puzzles

This page was built for publication: On a class of convex allocation problems