 |
| 1 | |
A two variable pure integer programming problem cannot be solved by the graphical method. |
| | A) | True |
| | B) | False |
|
|
|
| 2 | |
A feasible solution to a two variable pure integer programming problem can always be found by first solving the corresponding linear programming problem (i.e. problem obtained by ignoring the integrality constraints) and by rounding to the nearest integer all fractional values in the optimal solution to the linear programming problem. |
| | A) | True |
| | B) | False |
|
|
|
| 3 | |
Since the number of feasible solutions to a pure integer programming problem is lot less than the number of feasible solutions to the corresponding linear programming problem (i.e. problem obtained by ignoring the integrality constraints), pure integer programming problem must be easier to solve. |
| | A) | True |
| | B) | False |
|
|
|
| 4 | |
Problem A is a two variable linear programming problem with a maximization objective function. Problem B is a two variable pure integer programming problem obtained from Problem A by requiring the variables to be integers and leaving other things unchanged. If Problem A has an optimal solution, then Problem B must have an optimal solution. |
| | A) | True |
| | B) | False |
|
|
|
| 5 | |
Problem A is a two variable linear programming problem with a maximization objective function. Problem B is a two variable pure integer programming problem obtained from Problem A by requiring the variables to be integers and leaving other things unchanged. If Problem A has an optimal solution with integer objective function value, then Problem B must have an optimal solution. |
| | A) | True |
| | B) | False |
|
|
|
| 6 | |
For a typical integer programming problem, the number of feasible solutions ________________________ as the number of variables in the problem increases. |
| | A) | increases linearly |
| | B) | increases exponentially |
| | C) | decreases exponentially |
| | D) | decreases linearly |
|
|
|
| 7 | |
For a pure 0-1 integer programming problem with 3 variables, the maximum number of potential solutions is: |
| | A) | 9 |
| | B) | 27 |
| | C) | 16 |
| | D) | 8 |
|
|
|
| 8 | |
Branching in the branch and bound method refers to: |
| | A) | adding a constraint |
| | B) | removing a constraint |
| | C) | either adding or removing a constraint |
| | D) | removing a constraint and extending the feasible set. |
|
|
|
| 9 | |
In modeling a shopping mall construction problem, there are four potential locations giving rise to four 0-1 decision variables denoted as X1, X2, X3, X4 which takes a value of 1 if a mall is constructed and 0 otherwise. Identify the correct set of constraints to satisfy the following conditions: At most only one mall may be constructed among locations 1 and 3. |
| | A) | X1 + X3 ≤ 1 |
| | B) | X1 + X3 ≥ 1 |
| | C) | X1 + X3 < 1 |
| | D) | X1 + X3 = 1 |
|
|
|
| 10 | |
In modeling a shopping mall construction problem, there are four potential locations giving rise to four 0-1 decision variables denoted as X1, X2, X3, X4 which takes a value of 1 if a mall is constructed and 0 otherwise. Identify the correct set of constraint/s to satisfy the following conditions: If a mall is constructed in location 2, then a mall should be constructed in location 4. |
| | A) | X2 - X4 ≤ 0 |
| | B) | -X2 + X4 ≥ 0 |
| | C) | X2 - X4 ≤ 0 |
| | D) | -X2 + X4 ≤ 0 |
|
|
|
| 11 | |
An airport limousine service which parks all its limos at the airport can minimize its cost by using a proper order to pick up passengers from their houses and return to the airport using |
| | A) | set covering problem |
| | B) | traveling salesman problem |
| | C) | knapsack problem |
| | D) | fixed charge problem |
|
|
|
| 12 | |
An Avon lady carrying her tote containing makeup materials can maximize her profit from one trip to the rural Mississippi hinterland if she models the process of loading her bag (with the "right" materials having maximum profitability per unit volume) by using |
| | A) | set covering problem |
| | B) | traveling salesman problem |
| | C) | knapsack problem |
| | D) | fixed charge problem |
|
|
.