On the polynomial mixed 0-1 fractional programming problems

Ching Ter Chang

doi:10.1016/S0377-2217(00)00097-7

On the polynomial mixed 0-1 fractional programming problems

Ching Ter Chang

National Changhua University of Education

Research output: Contribution to journal › Journal Article › peer-review

39 Scopus citations

Abstract

This paper proposes a new method of solving polynomial mixed 0-1 fractional programming (P01FP) problems to obtain a global optimum. Given a polynomial 0-1 term x₁x₂, ..., x_ny, where x_i is a 0-1 variable and y is a continuous variable; we develop a linearization technique to transfer the x₁x₂, ..., x_ny term into a set of mixed 0-1 linear inequalities. Based on this technique, the P01FP can then be solved by a branch-and-bound method to obtain the global solution.

Original language	English
Pages (from-to)	224-227
Number of pages	4
Journal	European Journal of Operational Research
Volume	131
Issue number	1
DOIs	https://doi.org/10.1016/S0377-2217(00)00097-7
State	Published - 16 05 2001
Externally published	Yes

Access to Document

10.1016/S0377-2217(00)00097-7

Cite this

@article{b862a8e3f87045b6863e213f0c64823b,

title = "On the polynomial mixed 0-1 fractional programming problems",

abstract = "This paper proposes a new method of solving polynomial mixed 0-1 fractional programming (P01FP) problems to obtain a global optimum. Given a polynomial 0-1 term x1x2, ..., xny, where xi is a 0-1 variable and y is a continuous variable; we develop a linearization technique to transfer the x1x2, ..., xny term into a set of mixed 0-1 linear inequalities. Based on this technique, the P01FP can then be solved by a branch-and-bound method to obtain the global solution.",

author = "Chang, \{Ching Ter\}",

year = "2001",

month = may,

day = "16",

doi = "10.1016/S0377-2217(00)00097-7",

language = "英语",

volume = "131",

pages = "224--227",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - On the polynomial mixed 0-1 fractional programming problems

AU - Chang, Ching Ter

PY - 2001/5/16

Y1 - 2001/5/16

N2 - This paper proposes a new method of solving polynomial mixed 0-1 fractional programming (P01FP) problems to obtain a global optimum. Given a polynomial 0-1 term x1x2, ..., xny, where xi is a 0-1 variable and y is a continuous variable; we develop a linearization technique to transfer the x1x2, ..., xny term into a set of mixed 0-1 linear inequalities. Based on this technique, the P01FP can then be solved by a branch-and-bound method to obtain the global solution.

AB - This paper proposes a new method of solving polynomial mixed 0-1 fractional programming (P01FP) problems to obtain a global optimum. Given a polynomial 0-1 term x1x2, ..., xny, where xi is a 0-1 variable and y is a continuous variable; we develop a linearization technique to transfer the x1x2, ..., xny term into a set of mixed 0-1 linear inequalities. Based on this technique, the P01FP can then be solved by a branch-and-bound method to obtain the global solution.

UR - https://www.scopus.com/pages/publications/0035341826

U2 - 10.1016/S0377-2217(00)00097-7

DO - 10.1016/S0377-2217(00)00097-7

M3 - 文章

AN - SCOPUS:0035341826

SN - 0377-2217

VL - 131

SP - 224

EP - 227

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

On the polynomial mixed 0-1 fractional programming problems

Abstract

Access to Document

Other files and links

Fingerprint

Cite this