On the polynomial mixed 0-1 fractional programming problems

Research output: Contribution to journalJournal Article peer-review

37 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 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.

Original languageEnglish
Pages (from-to)224-227
Number of pages4
JournalEuropean Journal of Operational Research
Volume131
Issue number1
DOIs
StatePublished - 16 05 2001
Externally publishedYes

Fingerprint

Dive into the research topics of 'On the polynomial mixed 0-1 fractional programming problems'. Together they form a unique fingerprint.

Cite this