On a class of convex allocation problems

DOI10.1016/0022-247X(69)90224-8MaRDI QIDQ2538065zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• Dynamic Programming and "Difficult Crossing" Puzzles

Cited in

(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

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

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