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
Representation of Optimal Solution for Linear Programming Problem
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.