Abstract:
A class of problems is studied that are reducible to a functional linear programming problem. Three numerical solution methods are proposed for the latter: (1) for search for an optimal solution; (2) for search for a feasible solution or establishing the fact that there is none; (3) for search for a feasible solution assuming that there is one. All the three are reduced to solution of an auxiliary problem of minimizing the quadratic functional over a set of nonnegative functions and parameters. The crudest solution is obtained by the third method. Basic principle of computer implementation of the methods are given. Results of applying two methods to solution of the optimal response problem formulated for dynamic Leontieff-type models of economy.