Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | LI, HL | en_US |
dc.date.accessioned | 2014-12-08T15:20:06Z | - |
dc.date.available | 2014-12-08T15:20:06Z | - |
dc.date.issued | 1994-03-24 | en_US |
dc.identifier.issn | 0377-2217 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/14255 | - |
dc.description.abstract | Current methods of general 0-1 fractional programming (G-FP) can only find the local optimum. This paper proposes a new method of solving G-FP problems by a mixed 0-1 linear program to obtain a global optimum. Given a mixed 0-1 polynomial term xy where x is a 0-1 variable and 0 < y less-than-or-equal-to 1, we develop a theorem to transfer the xy term into a set of mixed 0-1 linear inequalities. Based on this theorem, a G-FP problem can be solved by a branch-and-bound method to obtain the global solution. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | 0-1 FRACTIONAL PROGRAMMING | en_US |
dc.subject | BRANCH-AND-BOUND METHOD | en_US |
dc.title | A GLOBAL APPROACH FOR GENERAL 0-1 FRACTIONAL-PROGRAMMING | en_US |
dc.type | Article | en_US |
dc.identifier.journal | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | en_US |
dc.citation.volume | 73 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 590 | en_US |
dc.citation.epage | 596 | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | 資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.contributor.department | Department of Information Management and Finance | en_US |
dc.identifier.wosnumber | WOS:A1994NM71000024 | - |
dc.citation.woscount | 30 | - |
Appears in Collections: | Articles |