Fei Pusheng

A branch and cut algorithm for solving the linear and quadratic integer programming problems

  • Fei Pusheng
  • Yan Zizong
  • Wan Zhongping
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Integer Programming Tags , , , ,

    This paper first presents an improve cutting plane method for solving the linear programming problems, based on the primal simplex method with the current equivalent facet technique, in which the increment of objection function is allowed as a pivot variable to decide the search step size. We obtain a strong valid inequality from the objective … Read more

    Classical Simplex Methods for Linear Programming and Their Developments

  • Fei Pusheng
  • Yan Zizong
  • Wang Xiaoli
    • Categories Convex Optimization Tags , , ,

    This paper presents a new primal dual simplex method and investigates the duality formation implying in classical simplex methods. We reviews classical simplex methods for linear programming problems and give a detail discussion for the relation between modern and classical algorithms. The two modified versions are present. The advantages of the new algorithms are simplicity … Read more