 |
| 1 | |
All linear programming problems may be solved using graphical method. |
| | A) | True |
| | B) | False |
|
|
|
| 2 | |
All linear programming problems with only two variables may be solved using graphical method. |
| | A) | True |
| | B) | False |
|
|
|
| 3 | |
In any graphically solvable linear program, if two points are feasible, then any weighted average of the two points where weights are non-negative and add up to 1.0 will also be feasible. |
| | A) | True |
| | B) | False |
|
|
|
| 4 | |
If a graphically solvable linear program is unbounded, then it can always be converted to a regular bounded problem by removing a constraint. |
| | A) | True |
| | B) | False |
|
|
|
| 5 | |
Assumptions of linear programming include |
| | A) | linearity |
| | B) | additivity |
| | C) | divisibility |
| | D) | certainty |
| | E) | all of the above |
|
|
|
| 6 | |
Divisibility assumption in linear programming implies |
| | A) | resources can be divided among products. |
| | B) | products can be divided among customers. |
| | C) | decision variables may take on integer values. |
| | D) | decision variables may take on fractional values. |
|
|
|
| 7 | |
XYZ Inc. produces two types of paper towels, called regular and super-soaker. Marketing has imposed a constraint that the total monthly production of regular should be no more than twice the monthly production of super-soakers. Letting X1 be the number of units of regular produced per month and X2 represent the number of units of super-soaker produced per month, the appropriate constraint/s will be |
| | A) | X1 ≤ 2X2. |
| | B) | 2X1 ≤ X2. |
| | C) | X1 ≤ 0.5X2. |
| | D) | X1 – X2 ≤ 0. |
| | E) | X1 – 0.5X2 ≥ 0. |
|
|
|
| 8 | |
XYZ Inc. produces two types of paper towels, called regular and super-soaker. Regular uses 2 units of recycled paper per unit of production and super-soaker uses 3 units of recycled paper per unit of production. The total amount of recycled paper available per month is 10,000. Letting X1 be the number of units of regular produced per month and X2 represent the number of units of super-soaker produced per month, the appropriate constraint/s will be |
| | A) | 2X1 + 3X2 = 10000. |
| | B) | 2X1 + 3X2 ≤ 10000. |
| | C) | 2X1 + 3X2 ≥ 10000. |
| | D) | 2X1 = 3X2. |
|
|
|
| 9 | |
XYZ Inc. produces two types of paper towels, called regular and super-soaker. Regular uses 2 units of recycled paper per unit of production and super-soaker uses 3 units of recycled paper per unit of production. The total amount of recycled paper available per month is 10,000. They also have a binding contract to use at least 8000 units of recycled paper per month with a local pollution control organization. Letting X1 be the number of units of regular produced per month and X2 represent the number of units of super-soaker produced per month, the appropriate constraint/s will be |
| | A) | 2X1 + 3X2 ≥ 8000. |
| | B) | 2X1 + 3X2 ≤ 10000. |
| | C) | 2X1 + 3X2 = 10000. |
| | D) | A or B but not both. |
| | E) | A and B. |
|
|
|
| 10 | |
XYZ Inc. produces two types of printers, called regular and high-speed. Regular uses 2 units of recycled plastic per unit and high-speed uses 1 unit of recycled plastic per unit of production. The total amount of recycled plastic available per month is 5,000. A critical machine is needed to manufacture the printers and each unit of Regular requires 5 units of time in this machine and each unit of high-speed requires 3 units of time in this machine. The total time available in this machine per month is 10000 units. Letting X1 be the number of units of regular produced per month and X2 represent the number of units of high-speed produced per month, the appropriate constraint/s will be |
| | A) | 2X1 + X2 = 5000. |
| | B) | 2X1 + X2 ≤ 5000. |
| | C) | 5X1 + 3X2 ≤ 10000. |
| | D) | A and C. |
| | E) | B and C. |
|
|
|
| 11 | |
XYZ Inc. produces two types of printers, called regular and high-speed. Regular uses 2 units of recycled plastic per unit and high-speed uses 1 unit of recycled plastic per unit of production. XYZ is committed to using at least 5,000 units of recycled plastic per month. A critical machine is needed to manufacture the printers and each unit of Regular requires 5 units of time in this machine and each unit of high-speed requires 3 units of time in this machine. The total time available in this machine per month is 15000 units. Letting X1 be the number of units of regular produced per month and X2 represent the number of units of high-speed produced per month, the appropriate constraint/s will be |
| | A) | 2X1 + X2 ≥ 5000. |
| | B) | 2X1 + X2 ≤ 5000. |
| | C) | 5X1 + 3X2 ≤ 15000. |
| | D) | A and C. |
|
|
|
| 12 | |
XYZ Inc. produces two types of printers, called regular and high-speed. Regular uses 2 units of recycled plastic per unit and high-speed uses 1 unit of recycled plastic per unit of production. XYZ is committed to using at least 5,000 units of recycled plastic per month. A critical machine is needed to manufacture the printers and each unit of Regular requires 5 units of time in this machine and each unit of high-speed requires 3 units of time in this machine. The total time available in this machine per month is 10000 units. Let X1 be the number of units of regular produced per month and X2 represent the number of units of high-speed produced per month. Imposing both of these constraints, and non-negativity constraints one of the feasible corner points is: (assuming the first number in parenthesis is X1 and the second number in the parenthesis is X2): |
| | A) | (0,0). |
| | B) | (2000,0). |
| | C) | None exists. |
| | D) | (0,5000). |
| | E) | (2500,0). |
|
|
.