... linear gola programming 线性目标规划法 linear convex programming 线性凸规划 large linear goal programming 大型线性目标规划 ...
基于6个网页-相关网页
Based on the dual relaxation method, an extended convex programming and sequential linear programming optimal power flow approach is presented for online optimal dispatch.
提出了一种基于对偶松弛法的扩展凸规划和序列线性规划相结合的在线最优潮流方法。
Objective: To search optimal solutions of convex programming problems with linear constraints.
求线性约束凸规划问题的最优解。
Based on the convex simplex method for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.
基于解非线形规划的凸单纯形法，对一类线形分式规划的消耗系数矩阵进行灵敏度分析。
应用推荐