An Approximate Method for Solving a Continuous Time Allocation Problem

DOI10.2307/1909553MaRDI QIDQ5606436zbMATH OpenOpenAlexFDO

Authors Jaromir Abrham

Publication date 1970

Published in Econometrica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1909553

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Cited in

(4)

• Cake eating, exhaustible resource extraction, life-cycle saving, and non-atomic games: existence theorems for a class of optimal allocation problems
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Continuous-time Programming
• A numerical method for a class of continuous concave programming problems

This page was built for publication: An Approximate Method for Solving a Continuous Time Allocation Problem

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