Full metadata record
DC FieldValueLanguage
dc.contributor.author盧浩鈞en_US
dc.contributor.authorHaochun Luen_US
dc.contributor.author黎漢林en_US
dc.contributor.authorHanlin Lien_US
dc.date.accessioned2014-12-12T02:48:21Z-
dc.date.available2014-12-12T02:48:21Z-
dc.date.issued2007en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009234801en_US
dc.identifier.urihttp://hdl.handle.net/11536/77183-
dc.description.abstract許多非線性問題需要逐段線性技術(Piecewise Linearization)將原始問題線性化以求得全域最佳解,而這過程需要加入許多二進位變數。近四十年來發展許多逐段線性之技術,而本研究就是發展出一套二進位變數的超級展現法(SRB)以便降低逐段線性技術所需之二進位變數其限制式。當一個擁有m+1個中斷點的線性化函數時,現有之逐段線性技術必須用m個二進位變數及4m個限制式,而本研究提出之方法只需log_2 m 個二進位變數及8+8*(log_2 m) 個限制式。同時本研究也展現數個實際問題之應用以證明它的高效率。zh_TW
dc.language.isoen_USen_US
dc.subject二進位變數zh_TW
dc.subject逐段線性化zh_TW
dc.subjectBinary variableen_US
dc.subjectPiecewise Linearizationen_US
dc.title整數規劃之高效率求解方法及其運用zh_TW
dc.titleAn Effective Method for Solving Large Binary Programs and Its Applicationsen_US
dc.typeThesisen_US
dc.contributor.department資訊管理研究所zh_TW
Appears in Collections:Thesis


Files in This Item:

  1. 480101.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.