Full metadata
Title
Global Optimization Using Piecewise Linear Approximation
Description
Global optimization (programming) has been attracting the attention of researchers for almost a century. Since linear programming (LP) and mixed integer linear programming (MILP) had been well studied in early stages, MILP methods and software tools had improved in their efficiency in the past few years. They are now fast and robust even for problems with millions of variables. Therefore, it is desirable to use MILP software to solve mixed integer nonlinear programming (MINLP) problems. For an MINLP problem to be solved by an MILP solver, its nonlinear functions must be transformed to linear ones. The most common method to do the transformation is the piecewise linear approximation (PLA). This dissertation will summarize the types of optimization and the most important tools and methods, and will discuss in depth the PLA tool. PLA will be done using nonuniform partitioning of the domain of the variables involved in the function that will be approximated. Also partial PLA models that approximate only parts of a complicated optimization problem will be introduced. Computational experiments will be done and the results will show that nonuniform partitioning and partial PLA can be beneficial.
Date Created
2020
Contributors
- Alkhalifa, Loay (Author)
- Mittelmann, Hans (Thesis advisor)
- Armbruster, Hans (Committee member)
- Escobedo, Adolfo (Committee member)
- Renaut, Rosemary (Committee member)
- Sefair, Jorge (Committee member)
- Arizona State University (Publisher)
Topical Subject
Resource Type
Extent
104 pages
Language
eng
Copyright Statement
In Copyright
Primary Member of
Peer-reviewed
No
Open Access
No
Handle
https://hdl.handle.net/2286/R.I.57051
Level of coding
minimal
Note
Doctoral Dissertation Mathematics 2020
System Created
- 2020-06-01 08:06:08
System Modified
- 2021-08-26 09:47:01
- 3 years 3 months ago
Additional Formats