| Description |
vii, 29 leaves : illustrations ; 28 cm. |
| Summary |
"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, leaf iii. |
|