A Study of Piecewise Linearization and Convex Underestimation Methods
碩士 === 國立臺北科技大學 === 商業自動化與管理研究所 === 95 === Many problems in management and engineering are constructed as nonlinear programming models. Various nonlinear programming techniques have been proposed in the past. Since the nonlinear programming models contain a lot of local optimal solutions, current me...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/92d776 |
id |
ndltd-TW-095TIT05682029 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-095TIT056820292019-06-27T05:10:09Z http://ndltd.ncl.edu.tw/handle/92d776 A Study of Piecewise Linearization and Convex Underestimation Methods 逐段線性與凸下界方法之研究 Mei-Yu Tsai 蔡梅玉 碩士 國立臺北科技大學 商業自動化與管理研究所 95 Many problems in management and engineering are constructed as nonlinear programming models. Various nonlinear programming techniques have been proposed in the past. Since the nonlinear programming models contain a lot of local optimal solutions, current methods have difficulty to obtain a globally optimal solution. This study presents three deterministic global optimization methods for nonlinear programming problems. The three methods guarantee to find a global optimum within a tolerable error. Moreover, an optimization system is developed to construct the mathematical model according to the three optimization methods automatically. Finally, practical examples are presented to compare the efficiency and properties of the optimization approaches. 蔡榮發 2007 學位論文 ; thesis 52 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺北科技大學 === 商業自動化與管理研究所 === 95 === Many problems in management and engineering are constructed as nonlinear programming models. Various nonlinear programming techniques have been proposed in the past. Since the nonlinear programming models contain a lot of local optimal solutions, current methods have difficulty to obtain a globally optimal solution. This study presents three deterministic global optimization methods for nonlinear programming problems. The three methods guarantee to find a global optimum within a tolerable error. Moreover, an optimization system is developed to construct the mathematical model according to the three optimization methods automatically. Finally, practical examples are presented to compare the efficiency and properties of the optimization approaches.
|
author2 |
蔡榮發 |
author_facet |
蔡榮發 Mei-Yu Tsai 蔡梅玉 |
author |
Mei-Yu Tsai 蔡梅玉 |
spellingShingle |
Mei-Yu Tsai 蔡梅玉 A Study of Piecewise Linearization and Convex Underestimation Methods |
author_sort |
Mei-Yu Tsai |
title |
A Study of Piecewise Linearization and Convex Underestimation Methods |
title_short |
A Study of Piecewise Linearization and Convex Underestimation Methods |
title_full |
A Study of Piecewise Linearization and Convex Underestimation Methods |
title_fullStr |
A Study of Piecewise Linearization and Convex Underestimation Methods |
title_full_unstemmed |
A Study of Piecewise Linearization and Convex Underestimation Methods |
title_sort |
study of piecewise linearization and convex underestimation methods |
publishDate |
2007 |
url |
http://ndltd.ncl.edu.tw/handle/92d776 |
work_keys_str_mv |
AT meiyutsai astudyofpiecewiselinearizationandconvexunderestimationmethods AT càiméiyù astudyofpiecewiselinearizationandconvexunderestimationmethods AT meiyutsai zhúduànxiànxìngyǔtūxiàjièfāngfǎzhīyánjiū AT càiméiyù zhúduànxiànxìngyǔtūxiàjièfāngfǎzhīyánjiū AT meiyutsai studyofpiecewiselinearizationandconvexunderestimationmethods AT càiméiyù studyofpiecewiselinearizationandconvexunderestimationmethods |
_version_ |
1719210378067443712 |