This preview shows pages 1–3. Sign up to view the full content.
a
Student: ___________________________________________________________________________
1.
Linear programming is a model with an explicit objective to be maximized or minimized.
True False
2.
The decision variables in a linear programming model must be nonnegative.
True False
3.
Each term in a linear program's objective function should be expressed in the same units.
True False
4.
Linear programming solutions may include a sensitivity report. This report gives information on making
changes in objective function coefficients.
True False
5.
The objective function in a linear programming model can be nonlinear.
True False
6.
In the conventional formulation of a linear programming model we will see all of the decision variables on
the righthandside of a constraint and a constant value on the lefthandside.
True False
7.
In the formulation of a linear programming model that will optimize production we expect to see all the
decision variables to be either zero or some positive value.
True False
8.
Minimizing the amount of scrap material generated by cutting steel, leather, or fabric from a roll or sheet of
stock material is one kind of problem that cannot be solved by linear programming.
True False
9.
Finding the optimal combination of products to stock in a warehouse cannot be solved using linear
programming.
True False
10. Finding the optimal product mix where several products have different costs and resource requirements
cannot be solved using linear programming.
True False
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document 11. Finding the optimal routing for a product that must be processed sequentially through several machine
centers, with each machine in a center having its own cost and output characteristics cannot be solved using
linear programming.
True False
12. If products and resources cannot be subdivided into fractions, the condition of divisibility is violated. In
these cases, a modification of linear programming called integral programming can be used.
True False
13. If products and resources cannot be subdivided into fractions, the condition of divisibility is violated. In
these cases, a modification of linear programming called integer programming can be used.
True False
14. When multiple objectives exist in a linear programming problem a technique called goal programming may
be used.
True False
15. A typical application of linear programming is in materials handling.
True False
16. Linear programming is useful when resources are unlimited.
True False
17. Finding the optimal location of a new plant by evaluating shipping costs between alternative locations and
supply and demand sources is one kind of problem that can be solved by linear programming.
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 01/05/2012 for the course COMMERCE 398 taught by Professor Dale during the Spring '11 term at The University of British Columbia.
 Spring '11
 dale

Click to edit the document details