An Approximate Method for Solving a Continuous Time Allocation Problem

DOI10.2307/1909553zbMath0206.22102OpenAlexW1995345595MaRDI QIDQ5606436

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)

Related Items (4)

A numerical method for a class of continuous concave programming problems ⋮ Continuous-time Programming ⋮ 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

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