 |
| 1 | |
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 |
|
|
|
| 2 | |
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 |
|
|
|
| 3 | |
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 |
|
|
|
| 4 | |
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 |
|
|
|
| 5 | |
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 |
|
|
|
| 6 | |
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 |
|
|
|
| 7 | |
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 |
|
|
|
| 8 | |
An agribusiness company mixes and sells chicken feed to farmers. The costs of the chicken feed ingredients vary throughout the chicken feeding season but the selling price of chicken feed is independent of the ingredients. On August 1, management needs to know how many units of each of three grains (Q, R, and S) should be included in their chicken feed in order to produce the product most economically. The cost of each grain is, for a unit of Q, $30; for a unit of R, $37; and for a unit of S, $78. Applying linear programming to this problem, which of the following is the objective function? |
| | A) | Minimize Z = 30 Q + 37 R + 78 S |
| | B) | Maximize Z = 30 Q + 37 R + 78 S |
| | C) | Minimize Z = (Q x R x S)/3 |
| | D) | Minimize Z = Q + R + S |
| | E) | Maximize Z = Q + R + S |
|
|
|
| 9 | |
Apply linear programming to this problem. A firm wants to determine how many units of each of two products (products D and E) they should produce to make the most money. The profit in the manufacture of a unit of product D is $100 and the profit in the manufacture of a unit of product E is $87. The firm is limited by its total available labor hours and total available machine hours. The total labor hours per week are 4,000. Product D takes 5 hours per unit of labor and product E takes 7 hours per unit. The total machine hours are 5,000 per week. Product D takes 9 hours per unit of machine time and product E takes 3 hours per unit. Which of the following is one of the constraints for this linear program? |
| | A) | 5 D + 7 E =< 5,000 |
| | B) | 9 D + 3 E => 4,000 |
| | C) | 5 D + 7 E = 4,000 |
| | D) | 5 D + 9 E =< 5,000 |
| | E) | 9 D + 3 E =< 5,000 |
|
|
|
| 10 | |
Apply linear programming to this problem. A firm wants to determine how many units of each of two products (products X and Y) they should produce in order to make the most money. The profit from making a unit of product X is $190 and the profit from making a unit of product Y is $112. The firm has a limited number of labor hours and machine hours to apply to these products. The total labor hours per week are 3,000. Product X takes 2 hours of labor per unit and Product Y takes 6 hours of labor per unit. The total machine hours available are 750 per week. Product X takes 1 machine hour per unit and Product Y takes 5 machine hours per unit. Which of the following is one of the constraints for this linear program? |
| | A) | 1 X + 5 Y =< 750 |
| | B) | 2 X + 6 Y => 750 |
| | C) | 2 X + 5 Y = 3,000 |
| | D) | 1 X + 3 Y =< 3,000 |
| | E) | 2 X + 6 Y =>3,000 |
|
|
|
| 11 | |
Apply linear programming to this problem. David and Harry operate a discount jewelry store. They want to determine the best mix of customers to serve each day. There are two types of customers for their store, retail (R) and wholesale (W). The cost to serve a retail customer is $70 and the cost to serve a wholesale customer is $89. The average profit from either kind of customer is the same. To meet headquarters' expectations, they must serve at least 8 retail customers and 12 wholesale customers daily. In addition, in order to cover their salaries, they must at least serve 30 customers each day. Which of the following is one of the constraints for this model? |
| | A) | 1 R + 1 W =< 8 |
| | B) | 1 R + 1 W => 30 |
| | C) | 8 R + 12 W => 30 |
| | D) | 1 R => 12 |
| | E) | 20 x (R + W) =>30 |
|
|
|
| 12 | |
Apply linear programming to this problem. A one-airplane airline wants to determine the best mix of passengers to serve each day. The airplane seats 25 people and flies 8 one-way segments per day. There are two types of passengers: first class (F) and coach (C). The cost to serve each first class passenger is $15 per segment and the cost to serve each coach passenger is $10 per segment. The marketing objectives of the airplane owner are to carry at least 13 first class passenger-segments and 67 coach passenger-segments each day. In addition, in order to break even, they must at least carry a minimum of 110 total passenger segments each day. Which of the following is one of the constraints for this linear program? |
| | A) | 15 F + 10 C => 110 |
| | B) | 1 F + 1 C => 80 |
| | C) | 13 F + 67 C => 110 |
| | D) | 1 F => 13 |
| | E) | 13 F + 67 C =< (80/200) |
|
|
|
| 13 | |
An objective function in a linear program can be which of the following? |
| | A) | A maximization function |
| | B) | A nonlinear maximization function |
| | C) | A quadratic maximization function |
| | D) | An uncertain quantity |
| | E) | A divisible additive function |
|
|
|
| 14 | |
The number of constraints allowed in a linear program is which of the following? |
| | A) | Less than 5 |
| | B) | Less than 72 |
| | C) | Less than 512 |
| | D) | Less than 1,024 |
| | E) | Unlimited |
|
|
|
| 15 | |
The number of decision variables allowed in a linear program is which of the following? |
| | A) | Less than 5 |
| | B) | Less than 72 |
| | C) | Less than 512 |
| | D) | Less than 1,024 |
| | E) | Unlimited |
|
|
.