中文

Operations Research Transactions ›› 2014, Vol. 18 ›› Issue (3): 71-78.

• Original Articles • Previous Articles     Next Articles

The bounded simplex method to solve the 0-1 linear integer programming problem

ZHANG Huizhen1,2,*, WEI Xin1, MA Liang1   

  1. 1. School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China, 2. Center for Supernetworks Research, University of Shanghai for Science and Technology, Shanghai 200093, China
  • Online:2014-09-15 Published:2014-09-15

PDF

835

Abstract: In this paper, a bounded simplex method to solve the 0-1 linear integer programming problem is proposed. Not only is the reasonability of this method proved from the point of mathematical theory, which establishes its theoretic foundation, but also is its feasibility validated from the point of numerical experiments by solving the un-capacitated facility location problem. Furthermore, the further improvement approach and techniques are discussed to overcome the shortcoming of this simplex method.

Key words: simplex method, 0-1 programming, bounded simplex method, pivoting iteration