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.
基于解非线形规划的凸单纯形法,对一类线形分式规划的消耗系数矩阵进行灵敏度分析。
The problem of collision detection between a pair of convex objects is summed up a problem of non-linear programming with restrict conditions in this paper.
将两凸物体间碰撞检测问题归结为一个带约束条件的非线性规划问题。
The problem of collision detection between a pair of convex objects is summed up a problem of non-linear programming with restrict conditions in this paper.
将两凸物体间碰撞检测问题归结为一个带约束条件的非线性规划问题。
应用推荐