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|
|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.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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.