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.
提出了一种求解线性规划问题的新方法：利用K—T条件及KS函数的凝聚特性，将多约束线性规划问题凝聚为单约束优化问题进行求解。
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.
提出了一种求解线性规划问题的新方法：利用K—T条件及KS函数的凝聚特性，将多约束线性规划问题凝聚为单约束优化问题进行求解。
应用推荐