365文库
登录
注册
福利来袭，限时免费在线编辑
转Pdf
下载我编辑的
下载原始文档
收藏
零落
上传于：2024-07-12
一、Determine whether the following statements are true or not, and mark the letter ‘T’ in the bracket if the statement is true, or else mark the letter ‘F’.（points）
The convex set has no extreme points. ( )
The function is concave. ( )
For linear programming problem, the dual is infeasible when the primal is unbounded. ( )
For the linear programming problem, any basic feasible solution is also an extreme point of the feasible region. ( )
For the method of steepest descent, the two consecutive search directions are orthogonal mutually. ( )
Consider the following linear programming problem
It is known that are optimal basic variables, write out the corresponding optimal simplex tableau.
(20 points)
Use the dual simplex method to solve the following LP
(20 points)
四、Letand assume can be rewrited as EMBED Equation.DSMT4 ,