UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

A Tractable Approach To Inverse Optimization Under Euclidean Norm

dc.contributor.authorEbrahimkhani, Sara
dc.date.accessioned2023-09-11T20:11:57Z
dc.date.available2024-01-10T05:50:05Z
dc.date.issued2023-09-11
dc.date.submitted2023-08-31
dc.description.abstractThe conventional optimization assumes that the problem and its parameters are known, and it utilizes this information to determine the optimal solution. Inverse optimization works in reverse by determining different parameters of an optimization model such that a given dataset of observed decisions from the past becomes optimal for the model. The parameters imputed through inverse optimization can be in the objective function and/or the constraints of the model. When inferring the constraint parameters, the choice of objective for the inverse optimization problem can result in different inverse optimal solutions. However, it is unclear which solution provides the best fit to the data. In this study, a goodness-of-fit measure is first introduced to evaluate the fit between the model and data and determine the quality of the inferred feasible region based on the distances of data points from its boundary. Next, employing this measure as the objective function, a multi-point inverse optimization problem under the Euclidean norm is proposed to infer the feasible region of a linear optimization model. Given the nonlinear nature of the Euclidean norm, a relaxation technique using the non-smooth L1 penalty function is proposed for the inverse optimization problem. This reformulates the non-convex mixed-integer quadratically-constrained programming problem into a mixed-integer quadratic programming problem which is more tractable. Then, an exact heuristic method and a greedy heuristic method are introduced to alleviate the computational challenges of the problem. Finally, two application examples to illustrate the practicality and effectiveness of our proposed model and solution approach are presented. In the first application, our model determines the implicit criteria based on which a patient is identified as an outpatient without requiring hospital supervision. The second application focuses on improving the recommended diets by uncovering hidden preferences and suggesting meal plans based on individuals' past food choices.en
dc.identifier.urihttp://hdl.handle.net/10012/19854
dc.language.isoenen
dc.pendingfalse
dc.publisherUniversity of Waterlooen
dc.titleA Tractable Approach To Inverse Optimization Under Euclidean Normen
dc.typeMaster Thesisen
uws-etd.degreeMaster of Applied Scienceen
uws-etd.degree.departmentManagement Sciencesen
uws-etd.degree.disciplineManagement Sciencesen
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.embargo.terms4 monthsen
uws.contributor.advisorMahmoudzadeh, Houra
uws.contributor.advisorAbouee Mehrizi, Hossein
uws.contributor.affiliation1Faculty of Engineeringen
uws.peerReviewStatusUnrevieweden
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Ebrahimkhani_Sara.pdf
Size:
2.96 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
6.4 KB
Format:
Item-specific license agreed upon to submission
Description: