In addition, based on linear programming relaxation theory, a method to compute the theoretical lower bound of MALMM's solution is introduced. 利用线性规划松弛(LPR)理论,设计一种求MALMM解理论下限的方法。
By utilizing an exponential variable transformation and linear underestimates of the objective and constraint functions, linear programming relaxation ( LPR ) about SGP is established, and the proposed determinate global optimization algorithm is proven that can converge to the globally optimal solution of SGP. 利用指数变换及对目标函数和约束函数的线性下界估计,提出一个求符号几何规划(SGP)问题全局解的确定型全局优化算法,并证明了算法的收敛性。
Linear Programming Relaxation(LPR) for Scheduling Problems 排序问题的线性规划松弛(LPR)方法
Linear Programming Relaxation(LPR) Algorithms for Scheduling Problem with Rejection 工件可拒绝排序问题的线性规划松弛(LPR)算法
A Successive Linear Programming Method for Max-cut SDP Relaxation 求解最大割问题的半定规划松驰的序列线性规划方法