摘要
讨论了一类双线性规划的优化问题。利用对偶原理 ,将双线性规划问题转化为极大极小问题 ,研究了该极大极小问题的线性逼近算法 ,并证明了该算法在有限步内收敛。采用Karmarkar算法优化初始迭代点 。
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.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2002年第5期561-564,共4页
Journal of Southwest Jiaotong University
