Abstract: A discussion is made of the optimization of a bilinear programming. The bilinear programming is converted into a max-min problem on the principle of duality, and a linear approximation algorithm for the max-min problem is presented, which proves to be convergent in finite steps. It is also shown that using Karmarkar algorithm to optimize the initial iteration point can make the linear approximation more effective.