文档介绍：江西财经大学
04-05 学年第二学期期末考试试卷
试卷代码:03883B 卷课时:64
课程名称:运筹学 I(英) 适用对象:03 管理科学专业
1. Label each of the following statements about linear programming problems as true or false. (10
points)
(a) When the simplex method solves for the next BF solution, elementary algebraic
operations are used to eliminate each nonbasic variable from all but one equation
(its equation) and to give it a coefficient of +1 in that one equation. ( )
(b) If a feasible solution is optimal but not a CPF solution, then infinitely many
optimal solutions exist. ( )
(c) The simplex method’s rule for choosing the entering basic variable is used
because it always leads to the best adjacent BF solution (largest Z).( )
(d) The simplex method’s minimum ratio rule fro choosing the leaving basic variable
is used because making another choice with a large ratio would yield a basic
solution that is not feasible.( )
(e) If at least one of the basic variables has a coefficient of zero in row 0 of the final
tableau, then the problem has multiple optimal solutions. ( ).
2. pany needs to lease warehouse storage space over the next 5 months. Just
how much space will be required in each of these months is known. However, since
these space requirements are quite different, it may be most economical to lease only
the amount needed each month on a month-by-month basis. On the other ha