Optimization problems with variational inequality constraints

Simple item page
dc.contributor.authorYe, Xiang Yangen_US
dc.date.accessioned2024-08-15T20:20:32Z
dc.date.available2024-08-15T20:20:32Z
dc.date.copyright1995en_US
dc.date.issued1995
dc.degree.departmentDepartment of Mathematics and Statisticsen_US
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractOptimization problems with variational inequality constraints are a class of mathematical programming problems which have variational inequalities as constraints. Due to the implicit hierarchical structure of the constraint region induced by variational inequalities, these problems are usually very difficult to solve. Nevertheless, they have very important applications in the areas such as economics, operations research and engineering. This thesis is devoted to necessary optimality conditions for such problems. Using the penalty methods and nonsmooth analysis technique, two types of necessary optimality conditions are derived.en
dc.format.extent76 pages
dc.identifier.urihttps://hdl.handle.net/1828/20287
dc.rightsAvailable to the World Wide Weben_US
dc.titleOptimization problems with variational inequality constraintsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
YE_XIANG_MSc_1995_685920.pdf
Size:
1.41 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
Theses (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.