Representation of Optimal Solution for Linear Programming Problem

Zhou Hanliang

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

Volume 17 Issue 2

Sep. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1995 > 17(2): 178-181,186

Zhou Hanliang. Representation of Optimal Solution for Linear Programming Problem[J]. Chinese Journal of Engineering, 1995, 17(2): 178-181,186. doi: 10.13374/j.issn1001-053x.1995.02.017

Citation:

Zhou Hanliang. Representation of Optimal Solution for Linear Programming Problem[J]. Chinese Journal of Engineering, 1995, 17(2): 178-181,186. doi: 10.13374/j.issn1001-053x.1995.02.017

Zhou Hanliang. Representation of Optimal Solution for Linear Programming Problem[J]. Chinese Journal of Engineering, 1995, 17(2): 178-181,186. doi: 10.13374/j.issn1001-053x.1995.02.017

Citation:

Zhou Hanliang. Representation of Optimal Solution for Linear Programming Problem[J]. Chinese Journal of Engineering, 1995, 17(2): 178-181,186. doi: 10.13374/j.issn1001-053x.1995.02.017

PDF( 358 KB)

Representation of Optimal Solution for Linear Programming Problem

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

Zhou Hanliang

Department of Mathematics and Mechanics, USTB, Beijing 100083, PRC

Received Date: 1993-11-30
Available Online: 2021-09-06

Abstract

Abstract

It is pointed out that optimal solution of linear programming can be represented as a sum of a convex combination of the optimal extreme points and a nonnegatively linear combination of the optimal extreme directions. The existential condition of optimal extreme direction is determined.
- basic feasible solution,
- extreme point,
- extreme direction,
- optimal solution