SOME GENERALIZATIONS OF THE DISCRETE OPTIMAL CONTROL PROBLEM.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1966
Accession Number
AD0643280

Entities

People

  • Seymour G. Bankoff

Organizations

  • Northwestern University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Convex Programming
  • Geometry
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Qualifications
  • Topology

Fields of Study

  • Mathematics

Readers

  • Control Systems Engineering.
  • Operations Research