Practical finite pivoting rules for the simplex method. Zbl 0714.90063
Pan, Ping-Qi |
|
1990
|
A basis-defiency-allowing variation of the simplex method for linear programming. Zbl 0941.90055
Pan, P.-Q. |
|
1998
|
The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study. Zbl 0921.90119
Pan, Pingqi |
|
1997
|
A simplex-like method with bisection for linear programming. Zbl 0739.90043
Pan, Ping-Qi |
|
1991
|
A dual projective simplex method for linear programming. Zbl 0907.90208
Pan, Ping-Qin |
|
1998
|
A variant of the dual pivoting rule in linear programming. Zbl 0816.90102
Pan, Pingqi |
|
1994
|
New ODE methods for equality constrained optimization. I: Equations. Zbl 0751.65037
Pan, Pingqi |
|
1992
|
A projective simplex method for linear programming. Zbl 0961.90061
Pan, Ping-Qi |
|
1999
|
A revised dual projective pivot algorithm for linear programming. Zbl 1093.65062
Pan, Ping-Qi |
|
2005
|
New non-monotone procedures for achieving dual feasibility. Zbl 0844.90055
Pan, Pingqi |
|
1995
|
A modified bisection simplex method for linear programming. Zbl 0856.65068
Pan, P. Q. |
|
1996
|
A phase-1 approach for the generalized simplex algorithm. Zbl 1002.90036
Pan, Ping-Qi; Pan, Yunpeng |
|
2001
|
A projective simplex algorithm using LU decomposition. Zbl 0974.90013
Pan, Pingqi |
|
2000
|
Primal perturbation simplex algorithms for linear programming. Zbl 0985.65064
Pan, Pingqi |
|
2000
|
A dual projective pivot algorithm for linear programming. Zbl 1062.90035
Pan, Ping-Qi |
|
2004
|
Efficient nested pricing in the simplex algorithm. Zbl 1159.90455
Pan, Ping-Qi |
|
2008
|
A largest-distance pivot rule for the simplex algorithm. Zbl 1149.90101
Pan, Ping-Qi |
|
2008
|
A fast simplex algorithm for linear programming. Zbl 1240.90271
Pan, Pingqi |
|
2010
|
An affine-scaling pivot algorithm for linear programming. Zbl 1273.90120
Pan, Ping-Qi |
|
2013
|
A primal deficient-basis simplex algorithm for linear programming. Zbl 1137.65361
Pan, Ping-Qi |
|
2008
|
Linear programming computation. Zbl 1302.90001
Pan, Ping-Qi |
|
2014
|
New ODE methods for equality constrained optimization. II: Algorithms. Zbl 0751.65038
Pan, Pingqi |
|
1992
|
Combined projected gradient algorithm for linear programming. Zbl 1113.90097
Li, Wei; Pan, Ping-Qi; Chen, Guangting |
|
2006
|
A new perturbation simplex algorithm for linear programming. Zbl 0940.65067
Pan, Pingqi |
|
1999
|
Partial pricing rule simplex method with deficient basis. Zbl 1166.90357
Pan, Pingqi; Li, Wei; Cao, Jun |
|
2006
|
Feasible region contraction interior point algorithm. Zbl 1107.65051
Pan, Ping-Qi; Hu, Jian-Feng; Li, Chen |
|
2006
|
Linear programming computation. Zbl 1302.90001
Pan, Ping-Qi |
|
2014
|
An affine-scaling pivot algorithm for linear programming. Zbl 1273.90120
Pan, Ping-Qi |
|
2013
|
A fast simplex algorithm for linear programming. Zbl 1240.90271
Pan, Pingqi |
|
2010
|
Efficient nested pricing in the simplex algorithm. Zbl 1159.90455
Pan, Ping-Qi |
|
2008
|
A largest-distance pivot rule for the simplex algorithm. Zbl 1149.90101
Pan, Ping-Qi |
|
2008
|
A primal deficient-basis simplex algorithm for linear programming. Zbl 1137.65361
Pan, Ping-Qi |
|
2008
|
Combined projected gradient algorithm for linear programming. Zbl 1113.90097
Li, Wei; Pan, Ping-Qi; Chen, Guangting |
|
2006
|
Partial pricing rule simplex method with deficient basis. Zbl 1166.90357
Pan, Pingqi; Li, Wei; Cao, Jun |
|
2006
|
Feasible region contraction interior point algorithm. Zbl 1107.65051
Pan, Ping-Qi; Hu, Jian-Feng; Li, Chen |
|
2006
|
A revised dual projective pivot algorithm for linear programming. Zbl 1093.65062
Pan, Ping-Qi |
|
2005
|
A dual projective pivot algorithm for linear programming. Zbl 1062.90035
Pan, Ping-Qi |
|
2004
|
A phase-1 approach for the generalized simplex algorithm. Zbl 1002.90036
Pan, Ping-Qi; Pan, Yunpeng |
|
2001
|
A projective simplex algorithm using LU decomposition. Zbl 0974.90013
Pan, Pingqi |
|
2000
|
Primal perturbation simplex algorithms for linear programming. Zbl 0985.65064
Pan, Pingqi |
|
2000
|
A projective simplex method for linear programming. Zbl 0961.90061
Pan, Ping-Qi |
|
1999
|
A new perturbation simplex algorithm for linear programming. Zbl 0940.65067
Pan, Pingqi |
|
1999
|
A basis-defiency-allowing variation of the simplex method for linear programming. Zbl 0941.90055
Pan, P.-Q. |
|
1998
|
A dual projective simplex method for linear programming. Zbl 0907.90208
Pan, Ping-Qin |
|
1998
|
The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study. Zbl 0921.90119
Pan, Pingqi |
|
1997
|
A modified bisection simplex method for linear programming. Zbl 0856.65068
Pan, P. Q. |
|
1996
|
New non-monotone procedures for achieving dual feasibility. Zbl 0844.90055
Pan, Pingqi |
|
1995
|
A variant of the dual pivoting rule in linear programming. Zbl 0816.90102
Pan, Pingqi |
|
1994
|
New ODE methods for equality constrained optimization. I: Equations. Zbl 0751.65037
Pan, Pingqi |
|
1992
|
New ODE methods for equality constrained optimization. II: Algorithms. Zbl 0751.65038
Pan, Pingqi |
|
1992
|
A simplex-like method with bisection for linear programming. Zbl 0739.90043
Pan, Ping-Qi |
|
1991
|
Practical finite pivoting rules for the simplex method. Zbl 0714.90063
Pan, Ping-Qi |
|
1990
|