Representation of Optimal Solution for Linear Programming Problem
-
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.
-
Key words:
- basic feasible solution /
- extreme point /
- extreme direction /
- optimal solution
-

計量
- 文章訪問數: 266
- HTML全文瀏覽量: 77
- PDF下載量: 5
- 被引次數: 0