The interior point cutting plane method (IPCPM) possesses both the advantages of cutting plane method and interior point method, so it is suitable for solving discrete optimization problems of large scale system.

In mathematics,an ellipsoidal surface can be approximated by a series of continuous secant facets,each of which passes through four corner points of corresponding grid formed by two geodetic parallels and two meridians and is taken as mapping plane.

In this projection mode, the ellipsoidal surface can be approximated mathematically by a series of continuous secant facets which are all isosceles trapezoids.

Based on the result that a global optimal solution to linear bilevel programming occurs at an extreme point of its constraint region, we discuss the structural feature of its feasible region and propose a global convergent algorithm which make use of cutting plane technique.

In this paper, we analyze the methods from two aspects, cutting planes and branching on the basis of branch-and-cut algorithms.

An analytic center cutting plane method is given,which solves a linear relaxation of the dual semidefinite program in every iteration,and uses an analytic center of cutting plane as the next iteration point.

Moreover,a cutting plane method of interactive linear multiple object decision which is more practical for decision process is used to solve the model.

The experimental result show that they are better than the Gomory cutting plane method on the average.

In the paper gives a way for a kind of acceleration getting the solution, by the appropriatetransformation to the gomory condition of cutting plane method that solved integral linear program-ming problem.