The Modelling Algorithm of Solving Integer Linear Programming of the Rational Coefficients

Gong Jinshuang; Li Zongyuan

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

Volume 13 Issue 4

Oct. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1991 > 13(4): 393-398

Gong Jinshuang, Li Zongyuan. The Modelling Algorithm of Solving Integer Linear Programming of the Rational Coefficients[J]. Chinese Journal of Engineering, 1991, 13(4): 393-398. doi: 10.13374/j.issn1001-053x.1991.04.035

Citation:

Gong Jinshuang, Li Zongyuan. The Modelling Algorithm of Solving Integer Linear Programming of the Rational Coefficients[J]. Chinese Journal of Engineering, 1991, 13(4): 393-398. doi: 10.13374/j.issn1001-053x.1991.04.035

Citation:

PDF( 442 KB)

The Modelling Algorithm of Solving Integer Linear Programming of the Rational Coefficients

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

Gong Jinshuang¹,
Li Zongyuan²

Peprment Of Mathematics and Mechanics

Received Date: 1990-05-04
Available Online: 2021-10-26

Abstract

Abstract

A new algorithm of solving integer linear programming is introduced in which the coefficients of the objective function are rational. This algorithm is called the modelling algorithm. In this algorithm, first of all, it can transform (ILP) into a special programming, then solve the special programming using a kind of special algorithm. The basic ideas of the algorithm is due to concentrating of the brance-bound and the cutting-plane, but it decreases the number of the branch and simplifies the technique of the cutting-plane.
- integer linear programming,
- modelling algorithm,
- natural cutting-plane