Average Relaxations of Extremal Problems
In this paper extremal problems that include averaging operation in constraints and objective are considered. The relaxation caused by a replacement of a problem without averaging with a problem that includes averaging is formally defined and investigated. Canonical form for nolinear programming problem with averaging is constructed and its conditions for optimality are derived. It is shown how optimality conditions for optimal control problems with various types of objectives and constraints can be derived using its averaged relaxation.
|Date of creation:||01 Jun 2003|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +61 2 9514 7777
Fax: +61 2 9514 7711
Web page: http://www.qfrc.uts.edu.au/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:uts:rpaper:100. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Duncan Ford)
If references are entirely missing, you can add them using this form.