【摘要】 提出了一种求解线性规划问题的新方法:利用K—T条件及KS函数的凝聚特性,将多约束线性规划问题凝聚为单约束优化问题进行求解.最后给出了二维及三维线性规划问题的实例及相应的几何解释.更多还原

【Abstract】 A new method solving linear programming problem is presented. Using K-T condition and the aggregation properties of KS function, a multi-constraints linear programming problem is become a single constraint linear programming problem. Examples of 2-D and 3-D linear programming problems and the corresponding gecometrical explanations are also given.更多还原