Optimal control of security portfolio

Finding an optimal strategy for the security portfolio during a given period is formulated as a problem of linear programming. It is shown that if the restrictions on the risk or on the buy/sale volumes are omitted then the problem is decomposed into some “one-stock” problems. This fact permits one to reduce the calculation complexity of the whole problem. Finally, for the optimization problem with the restrictions on the risk an approximate method is presented.