摘要
给出了这样的结果:线性规划问题在最优解x*=x1*,x2*,…,xn*)T唯一时,下述线性规划问题的最优解亦必是x*。其中, 即解x*具有全优性。引进了全优单纯形方法的概念,并给出了迭代步骤。
The in terchange between the objective function and any one of restricted conditions in linear programing has been studied in the paper.The unique optimum solution has been given with global optimization characteristics.The simplex method of global optimization has been introduced and iterative process has been described.
出处
《辽宁师范大学学报（自然科学版）》
CAS
1989年第3期8-14,共7页
Journal of Liaoning Normal University:Natural Science Edition
关键词
线性规划
全优单纯形法
the simplex method of global optimization
