This paper sets forward a new, simple, and direct approach to solving the linear maximum function programming.
本文提出了一种求解线性最大值函数规划的简捷方法。
Then using the approach to the transportation problem in the linear programming, a network configuration with optimal current-flow and minimum line-loss can be found out.
然后按线性规划中运输问题的解法，寻求最小线损网架的优化电流潮流，从而定出合理的线损最小网架。
Based on the dual relaxation method, an extended convex programming and sequential linear programming optimal power flow approach is presented for online optimal dispatch.
提出了一种基于对偶松弛法的扩展凸规划和序列线性规划相结合的在线最优潮流方法。
Starting from the Operations Research, this paper proposes method of linear programming approach with weight to fitting variogram, effectively guarantee the non-negative of the results of solving.
从运畴学的角度出发，提出了基于带权线性规划的方法拟合变差函数，有效地保证了求解结果的非负性。
Starting from the Operations Research, this paper proposes method of linear programming approach with weight to fitting variogram, effectively guarantee the non-negative of the results of solving.
从运畴学的角度出发，提出了基于带权线性规划的方法拟合变差函数，有效地保证了求解结果的非负性。
应用推荐