Converting some global optimization problems to mixed integer linear problems using piecewise linear approximations

Author

Manish Kumar

Keywords and Phrases

Log-sum functions

Abstract

"Some global optimization problems are converted to mixed-integer linear problems (MILP) using piecewise-linear approximations in this thesis so that they can be solved using commercial MILP solvers, such as CPLEX. Special attention is given to approximating two-term log-sum functions, which appears frequently in generalized geometric programming problems. Numerical results indicate the proposed approach is sound and efficient"--Abstract, page iii.

Advisor(s)

Tseng, Chung-Li

Committee Member(s)

Spurlock, David
Yu, Vincent (Wen-Bin)

Department(s)

Engineering Management and Systems Engineering

Degree Name

M.S. in Engineering Management

Publisher

University of Missouri--Rolla

Publication Date

Fall 2007

Pagination

vii, 29 pages

Note about bibliography

Includes bibliographical references (pages 65-67).

Rights

© 2007 Manish Kumar, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Subject Headings

Approximation theory
Integer programming
Linear programming
Mathematical optimization

Thesis Number

T 9254

Print OCLC #

233699287

Electronic OCLC #

182863509

Link to Catalog Record

http://merlin.lib.umsystem.edu/record=b6400571~S5

Recommended Citation

Kumar, Manish, "Converting some global optimization problems to mixed integer linear problems using piecewise linear approximations" (2007). Masters Theses. 6822.
https://scholarsmine.mst.edu/masters_theses/6822