A Polynomial-Time Algorithm for Liner Fractional Programming

Zhou Hanliang

doi:10.13374/j.issn1001-053x.1986.01.030

Volume 8 Issue 1

Nov. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1986 > 8(1): 150-155

Zhou Hanliang. A Polynomial-Time Algorithm for Liner Fractional Programming[J]. Chinese Journal of Engineering, 1986, 8(1): 150-155. doi: 10.13374/j.issn1001-053x.1986.01.030

Citation:

Zhou Hanliang. A Polynomial-Time Algorithm for Liner Fractional Programming[J]. Chinese Journal of Engineering, 1986, 8(1): 150-155. doi: 10.13374/j.issn1001-053x.1986.01.030

Zhou Hanliang. A Polynomial-Time Algorithm for Liner Fractional Programming[J]. Chinese Journal of Engineering, 1986, 8(1): 150-155. doi: 10.13374/j.issn1001-053x.1986.01.030

Citation:

Zhou Hanliang. A Polynomial-Time Algorithm for Liner Fractional Programming[J]. Chinese Journal of Engineering, 1986, 8(1): 150-155. doi: 10.13374/j.issn1001-053x.1986.01.030

PDF( 359 KB)

A Polynomial-Time Algorithm for Liner Fractional Programming

doi: 10.13374/j.issn1001-053x.1986.01.030

Zhou Hanliang

Received Date: 1985-10-08
Available Online: 2021-11-15

Abstract

Abstract

A.Charnes and W.W.Cooper presented an algorithm for liner fractional programming.We prove that the liner fractional programming is an equivalent of a certain liner programming;then we use Karmarkar algorithm for the liner programming to get the polynomial-time algorithm for liner fractional programming.
- polynomial-time algorithm,
- Karmarkar main algorithm,
- strictly interior point,
- projective transformation,
- sliding objectiv function