Modification to Wolfe's Simplex Method

Liu Ping; Ling Xiaodong

doi:10.13374/j.issn1001-053x.1997.02.018

Volume 19 Issue 2

Aug. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1997 > 19(2): 201-204,217

Liu Ping, Ling Xiaodong. Modification to Wolfe's Simplex Method[J]. Chinese Journal of Engineering, 1997, 19(2): 201-204,217. doi: 10.13374/j.issn1001-053x.1997.02.018

Citation:

Liu Ping, Ling Xiaodong. Modification to Wolfe's Simplex Method[J]. Chinese Journal of Engineering, 1997, 19(2): 201-204,217. doi: 10.13374/j.issn1001-053x.1997.02.018

Liu Ping, Ling Xiaodong. Modification to Wolfe's Simplex Method[J]. Chinese Journal of Engineering, 1997, 19(2): 201-204,217. doi: 10.13374/j.issn1001-053x.1997.02.018

Citation:

Liu Ping, Ling Xiaodong. Modification to Wolfe's Simplex Method[J]. Chinese Journal of Engineering, 1997, 19(2): 201-204,217. doi: 10.13374/j.issn1001-053x.1997.02.018

PDF( 408 KB)

Modification to Wolfe's Simplex Method

doi: 10.13374/j.issn1001-053x.1997.02.018

Liu Ping¹,
Ling Xiaodong²

1. Information Engineering School, UST Beijing, Beijing 100083, China;
2. CITIC Research Intemational

Received Date: 1996-10-02
Available Online: 2021-08-27

Abstract

Abstract

To guarantee the convergence of the algorithm, the short form of Wolfe's method requires the coefficients of the objective function and constraint equations to satisfy some specific conditions. The above conditions of the convergence theorem can be eliminated by the improved method.
- quadratic programming,
- simplex method,
- numerical implementation,