|
An Approximate Method for Solving a Continuous Time Allocation Problem
Jaromir Abrham
Abstract
The problem consists in maximizing a concave functional--given as an integral--on a class of functions. A method based on approximating optimal solutions by step functions is suggested; approximations are found by solving concave programming problems of a special type. Some convergence theorems are proved and an estimate of the error in terms of values of the objective functional is given.
|
