Abstract:
A solution method is proposed for one class of mathematical programming, MP, problems dual to successive optimization problems. An auxiliary discrete-time control problem is introduced whose solution is found by a discrete version of the dynamic programming method. The solution of the auxiliary problem is found to be that for the MP problem.