SOME GENERALIZATIONS OF THE DISCRETE OPTIMAL CONTROL PROBLEM.
NORTHWESTERN UNIV EVANSTON ILL INFORMATION-PROCESSING AND CONTROL SYSTEMS LAB
Pagination or Media Count:
Some modifications of the Kuhn-Tucker constraint qualifications are given for non-linear programming problems where non-linear equality constraints are present. The treatment by Rosen of optimal discrete control problems is then generalized to include cyclic topologies. In addition, an approach to the discrete analog of the minimum-time problems is outlined. Author
- Operations Research