Legit Test Bank - Operations and Supply Management The Core By Jacobs

App: A
Linear Programming using the’ Excel Solver

T/F Qs:



1. Linear programming is a model with an objective function 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’ right-hand-side of a constraint and a constant value on the’ left-hand-side.
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



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



MCQs:



15. Which of the’ following is an essential condition in a situation for linear programming to be useful?
A. Nonlinear constraints
B. Bottlenecks in the’ objective function
C. Homogeneity
D. Uncertainty
E. Competing objectives



16. Which of the’ following is not an essential condition in a situation for linear programming to be useful?
A. An explicit objective function
B. Uncertainty
C. Linearity
D. Limited resources
E. Divisibility



17. Which of the’ following is a common application of linear programming in operations management?
A. Cycle counting analysis
B. Cost of quality studies
C. Cost allocation studies
D. Plant location studies
E. Product design decisions

, 18. There are other related mathematical programming techniques that can be used instead of linear
programming if the’ problem has a unique characteristic. If the’ problem has multiple objectives we should use
which of the’ following methodologies?
A. Goal programming
B. Orthogonal programming
C. Integer programming
D. Multiplex programming
E. Dynamic programming



19. There are other related mathematical programming techniques that can be used instead of linear
programming if the’ problem has a unique characteristic. If the’ problem is best solved in stages or time frames
we should use which of the’ following methodologies?
A. Goal programming
B. Temporal programming
C. Integer programming
D. Genetic programming
E. Dynamic programming



20. There are other related mathematical programming techniques that can be used instead of linear
programming if the’ problem has a unique characteristic. If the’ problem prevents divisibility of products or
resources we should use which of the’ following methodologies?
A. Goal programming
B. Primary programming
C. Integer programming
D. Unit programming
E. Dynamic programming



21. A company wants to determine how many units of each of two products, A and B, they should produce. The’
profit on product A is $50 and the’ profit on product B is $45. Applying linear programming to this problem,
which of the’ following is the’ objective function if the’ firm wants to make as much money as possible?
A. Minimize Z = 50 A + 45 B
B. Maximize Z = 50 A + 45 B
C. Maximize Z = A + B
D. Minimize Z = A + B
E. Maximize Z = A/45B + B/50A