完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLi, Han-Linen_US
dc.contributor.authorLu, Hao-Chunen_US
dc.contributor.authorHuang, Chia-Huien_US
dc.contributor.authorHu, Nian-Zeen_US
dc.date.accessioned2014-12-08T15:09:54Z-
dc.date.available2014-12-08T15:09:54Z-
dc.date.issued2009-03-01en_US
dc.identifier.issn1091-9856en_US
dc.identifier.urihttp://dx.doi.org/10.1287/ijoc.1080.0294en_US
dc.identifier.urihttp://hdl.handle.net/11536/7569-
dc.description.abstractMany nonlinear programs can be piecewisely linearized by adding extra binary variables. For the last four decades, several techniques of formulating a piecewise linear function have been developed. By expressing a piecewise linear function with m+1 break points, the current method requires us to use m additional binary variables and 4m constraints, which causes heavy computation when m is large. This study proposes a superior way of expressing the same piecewise linear function, where only [log(2)m] binary variables and 8+8 [log(2)m] additive constraints are used. Various numerical experiments demonstrate that the proposed method is more computationally efficient than current methods.en_US
dc.language.isoen_USen_US
dc.subjectmathematicsen_US
dc.subjectpiecewise linearen_US
dc.subjectprogrammingen_US
dc.subjectintegeren_US
dc.titleA Superior Representation Method for Piecewise Linear Functionsen_US
dc.typeArticleen_US
dc.identifier.doi10.1287/ijoc.1080.0294en_US
dc.identifier.journalINFORMS JOURNAL ON COMPUTINGen_US
dc.citation.volume21en_US
dc.citation.issue2en_US
dc.citation.spage314en_US
dc.citation.epage321en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000265756900010-
dc.citation.woscount13-
顯示於類別:期刊論文