文档介绍：江西财经大学
04-05 学年第二学期期末考试试卷
试卷代码:03883A 卷课时:64
课程名称:运筹学 I(英) 适用对象:03 管理科学专业
each of the following statements about linear programming problems as true
or false. (10 points)
(a) The sum of the number of functional constraints and the number of variables
(before augmenting) is the same for both the primal and the dual problems.
( ).
(b) At each iteration, the simplex method simultaneously identifies a CPF solution for
the primal problem and a CPF solution for the dual problem such that their
objective function values are the same. ( )
(c) If the value of the objective function is equal at two different feasible points X*
and X**, then all points on the line segment connecting X* and X** are feasible
and Z has the same value at all those points. ( ).
(d) Only CPF solutions can be optimal, so the number of optimal solutions cannot
exceed the number of CPF solutions. ( ).
(e) The dual simplex method is always used to solve the dual programming.( )
manufacturing firm has discontinued the production of a certain unprofitable
product line. This act created considerable excess production capacity. Management is
considering devoting this excess capacity to one or more of three products; call them
products 1,2, and 3. The available capacity on the machines that might limit output is
summarized in the following table:
Mach