Average Relaxations of Extremal Problems
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Quantitative Finance Research Centre, University of Technology, Sydney in its series Research Paper Series with number 100.
Date of creation: 01 Jun 2003
Date of revision:
Contact details of provider:
Postal: PO Box 123, Broadway, NSW 2007, Australia
Phone: +61 2 9514 7777
Fax: +61 2 9514 7711
Web page: http://www.business.uts.edu.au/qfrc/index.html
More information through EDIRC
averaging; constraint relaxation; nonlinear programming; optimal control problem; optimality conditions;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2004-06-02 (All new papers)
You can help add them by filling out this form.
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.