期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Partial Pricing Rule Simplex Method with Deficient Basis 被引量:1
1
作者 pingqi pan Wei Li Jun Cao 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 2006年第1期23-30,共8页
A new partial pricing column rule is proposed to the basis-deficiency-allowing simplex method developed by Pan.Computational results obtained with a set of small problems and a set of standard NETLIB problems show its... A new partial pricing column rule is proposed to the basis-deficiency-allowing simplex method developed by Pan.Computational results obtained with a set of small problems and a set of standard NETLIB problems show its promise of success. 展开更多
关键词 线性规划 单纯形法 部分定价 定价原理
下载PDF
Higher Order Iteration Schemes for Unconstrained Optimization
2
作者 Yangyang Shi pingqi pan 《American Journal of Operations Research》 2011年第3期73-83,共11页
Using a predictor-corrector tactic, this paper derives new iteration schemes for unconstrained optimization. It yields a point (predictor) by some line search from the current point;then with the two points it constru... Using a predictor-corrector tactic, this paper derives new iteration schemes for unconstrained optimization. It yields a point (predictor) by some line search from the current point;then with the two points it constructs a quadratic interpolation curve to approximate some ODE trajectory;it finally determines a new point (corrector) by searching along the quadratic curve. In particular, this paper gives a global convergence analysis for schemes associated with the quasi-Newton updates. In our computational experiments, the new schemes using DFP and BFGS updates outperformed their conventional counterparts on a set of standard test problems. 展开更多
关键词 UNCONSTRAINED Optimization ITERATION Scheme ODE Method QUASI-NEWTON Update Convergence Analysis
下载PDF
A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING 被引量:3
3
作者 pingqi pan 《Journal of Computational Mathematics》 SCIE CSCD 2010年第6期837-847,共11页
Recently, computational results demonstrated remarkable superiority of a so-called "largest-distance" rule and "nested pricing" rule to other major rules commonly used in practice, such as Dantzig's original rule... Recently, computational results demonstrated remarkable superiority of a so-called "largest-distance" rule and "nested pricing" rule to other major rules commonly used in practice, such as Dantzig's original rule, the steepest-edge rule and Devex rule. Our computational experiments show that the simplex algorithm using a combination of these rules turned out to be even more efficient. 展开更多
关键词 Large-scale linear programming Simplex algorithm Pivot rule Nested Largestdistance Scaling.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部