Question 1

A common feature of set covering, knapsack, and location problems is that all of them use 0-1 variables.

Accepted Answer

A) True 
 B)False  True

Question 2

A cargo plane has two compartments for storing cargo, front and back. These compartments have capacity limits on both weight and space, as summarized below.
   
They have three available cargos for an upcoming flight. The details are given below:
   
For maintaining balance, the total weight of the cargo loaded in the back must be more than the total cargo loaded in the front. Each cargo must be accepted in full and loaded entirely in front or back. The objective is to determine which must be accepted and where it should go in the plane, so as to maximize total profit. Formulate this as an integer linear program.

Accepted Answer

Decision variables (a series of 0-1 variables that would take a value of 1 if it is chosen and 0 otherwise):
 Let $X_{i j}$ be 1 if cargo i loaded in compartment $\mathrm{j}$ and 0 otherwise
Objective function:
for $\mathrm{i} \varepsilon\{\mathrm{A}, \mathrm{B}, \mathrm{C}, \mathrm{D}, \mathrm{E}\}$ and $\mathrm{j} \varepsilon\{\mathrm{F}, \mathrm{B}\}$ where $\mathrm{F}$ stands for front and $\mathrm{B}$ for back
Max:
$1000 X_{A B}+1560 X_{B B}+1350 X_{C B}+720 X_{D B}+1210 X_{E B}$
$$1000 X_{A F}+1560 X_{B F}+1350 X_{C F}+720 X_{D F}+1210 X_{E F}+$$
$10000 X_{A F}+120000 X_{B F}+15000 X_{C F}+8000 X_{D F}+11000 X_{E F} \leq 16000$
$10000 X_{A B}+120000 X_{B B}+15000 X_{C B}+8000 X_{D B}+11000 X_{E B} \leq 24000$
$2500 X_{A F}+4200 X_{B F}+4500 X_{C F}+2240 X_{D F}+3520 X_{E F} \leq 5000$
$2500 X_{A B}+4200 X_{B B}+4500 X_{C B}+2240 X_{D B}+3520 X_{E B} \leq 7000$
$X_{A F}+X_{A B} \leq 1$
$X_{B F}+X_{B B} \leq 1$
$X_{C F}+X_{C B} \leq 1$
$X_{D F}+X_{D B} \leq 1$
$X_{E F}+X_{E B} \leq 1$
$10000 X_{A F}+12000 X_{B F}+15000 X_{C F}+8000 X_{D F}+11000 X_{E F}-10000 X_{A B}-12000 X_{B B}-15000 X_{C B}-8000 X_{D B}-11000 X_{E B} \leq 0$ Variables are $0-1$
Solver solution:
$X_{C F}=1$
$X_{A B}=1$
$X_{B B}=1$
All other variables are 0 . The objective function value will be equal to $\$ 3910$
The objective function value corresponding to the optimal solution is $\$ 4600.00$

Question 3

A retail outlet wants to replace a broken ice cream vending machine with one of two models. Purchase of model 1 machine is captured by variable $X_{1}$ taking a value of 1 and 0 if not purchased. $X_{2}$ is similarly defined. They would also want to allow for the possibility of getting rid of the old machine with no replacement. One of the constraints for this problem would be

Accepted Answer

A)  $\mathrm{X}_{1}+\mathrm{X}_{2}$1 
A)  $\mathrm{X}_{1}+\mathrm{X}_{2}$1 B

Question 4

If a problem contains data on profit as well as cost, it cannot be formulated as an integer programming problem. We have to pick one or the other and then do the formulation.

Accepted Answer

A) True 
 B)False

Question 5

A Mississippi farmer is considering adding a special breed of bull to his farm. Let $X_{1}=1$ imply that the bull will be purchased and 0 otherwise. If it is purchased, then the pounds of organic soy purchased per day (denoted by $\mathrm{X}_{2}$ ) and the pounds of organic corn purchased per day (denoted by $\mathrm{X}_{3}$ ) should be at most 50. If the bull is not purchased, then $2 *$ the pounds of organic soy purchased $-3^{*}$ the pounds of organic corn purchased should be at most 30. The constraint/s that implements this would be (M stands for a very big positive number and assume non-negative variables)

Accepted Answer

A)  $X_{2}+X_{3} \geq 50+M^{*} X_{1}$ and $2 X_{2}-3 X_{3} \geq 30+M^{*}\left(1-X_{1}\right)$ 
B)  $X_{2}+X_{3} \geq 50 X_{1}$ and $2 X_{2}-3 X_{3} \geq 30\left(1-X_{1}\right)$ 
C)  $X_{2}+X_{3} \leq 50 * X_{1}$ and $2 X_{2}-3 X_{3} \leq 30\left(1-X_{1}\right)$ 
D)  $X_{2}+X_{3} \leq 50+M^{*}\left(1-X_{1}\right)$ and $2 X_{2}-3 X_{3} \leq 30+M^{*} X_{1}$ 
A)  $X_{2}+X_{3} \geq 50+M^{*} X_{1}$ and $2 X_{2}-3 X_{3} \geq 30+M^{*}\left(1-X_{1}\right)$ 
B)  $X_{2}+X_{3} \geq 50 X_{1}$ and $2 X_{2}-3 X_{3} \geq 30\left(1-X_{1}\right)$ 
C)  $X_{2}+X_{3} \leq 50 * X_{1}$ and $2 X_{2}-3 X_{3} \leq 30\left(1-X_{1}\right)$ 
D)  $X_{2}+X_{3} \leq 50+M^{*}\left(1-X_{1}\right)$ and $2 X_{2}-3 X_{3} \leq 30+M^{*} X_{1}$

Question 6

A retail outlet wants to replace a broken ice cream vending machine with one of two models. The purchase of model 1 is captured by variable X1, taking a value of 1 and 0 if not purchased. X2 is similarly defined. They would not be opposed to buying both machines, though buying one of them is a must. One of the constraints for this problem would be

Accepted Answer

A)  $\mathrm{X}_{1}+\mathrm{X}_{2}$1 
A)  $\mathrm{X}_{1}+\mathrm{X}_{2}$1

Question 7

In general, we consider more feasible solutions in solving integer linear programming problems. as compared to solving linear programming problems by simplex method.
1.

Accepted Answer

A) True 
 B)False

Question 8

In modeling a traveling salesman problem, let $X_{\mathrm{ijk}}$ be a 0-1 decision variable, which takes a value of 0 if in the kth leg the tour corresponding to the solution does not go from node $\mathrm{i}$ to node $\mathrm{j}$. $\mathrm{X}_{\mathrm{ijk}}$ is set to be equal to 1 if the tour goes from node $i$ to node $\mathrm{j}$ in the kth leg. In a problem with just 4 nodes and without loss of generality, assume that the tour starts and ends in node 1. Mark the correct constraint to make sure that the tour ends in node 1

Accepted Answer

A)  $\mathrm{X}_{214}+\mathrm{X}_{314}+\mathrm{X}_{414} \leq 1$ 
B)  $X_{214}+X_{314}+X_{414} \geq 1$ 
C)  $X_{214}+X_{314}+X_{414}=1$ 
D)  $\mathrm{X}_{121}+\mathrm{X}_{131}+\mathrm{X}_{141}=1$ 
A)  $\mathrm{X}_{214}+\mathrm{X}_{314}+\mathrm{X}_{414} \leq 1$ 
B)  $X_{214}+X_{314}+X_{414} \geq 1$ 
C)  $X_{214}+X_{314}+X_{414}=1$ 
D)  $\mathrm{X}_{121}+\mathrm{X}_{131}+\mathrm{X}_{141}=1$

Question 9

In a plant location problem with 5 potential locations, each with an associated 0-1 decision variable, $X_{1}$, $X_{2}, X_{3}, X_{4}$,and $X_{5}$, which take a value of 1 if a plant is located in that location and 0 otherwise, the constraint to make sure that at least 3 plants are put up will be

Accepted Answer

A) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5}>3.0$ B) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5} \geq 3.0$ C) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5}=3.0$ D) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5} \leq 3.0$ E) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5}<3.0$ A) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5}>3.0$ B) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5} \geq 3.0$ C) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5}=3.0$ D) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5} \leq 3.0$ E) $X_{1}+X_{2}+X_{3}+X_{4}+X_{5}<3.0$

Question 10

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.

Accepted Answer

A) True 
 B)False

Question 11

In modeling a traveling salesman problem, let $X_{i j k}$ be a 0-1 decision variable, which takes a value of 0 if in the kth leg the tour corresponding to the solution does not go from node $\mathrm{i}$ to node $\mathrm{j}$. $\mathrm{X}_{\mathrm{ijk}}$ is set to be equal to 1 if the tour goes from node $\mathrm{i}$ to node $\mathrm{j}$ in the kth leg. In a problem with just 4 nodes and without loss of generality, assume that the tour starts and ends in node 1 . If, in a particular solution, $X_{213}=1$, it means that the tour corresponding to the solution

Accepted Answer

A)  goes from node 3 to 1 in the 2nd leg 
B)  goes from node 2 to 1 in the 3rd leg 
C)  goes from node 1 to 2 in the 3rd leg 
D)  goes from node 1 to 3 in the 2 nd leg 
A)  goes from node 3 to 1 in the 2nd leg 
B)  goes from node 2 to 1 in the 3rd leg 
C)  goes from node 1 to 2 in the 3rd leg 
D)  goes from node 1 to 3 in the 2 nd leg

Question 12

For a pure 0-1 integer programming problem with 3 variables, the maximum number of potential solutions is

Accepted Answer

A)  9 
B)  27 
C)  16 
D)  8 
A)  9 
B)  27 
C)  16 
D)  8

Question 13

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 down the fractional values in the optimal solution to the linear programming problem.

Accepted Answer

A) True 
 B)False

Question 14

A jumbo jet factory can produce two types of planes\_-UnitMach and BigMach. UnitMach takes 6 man weeks of labor and 7 units of critical machine time. BigMach takes 8 man weeks of labor and 12 units of critical machine time. The total man weeks of labor available during the planning horizon are 50; total units of machine time available during the planning horizon are 70 . Contribution of UnitMach is $\$ 10,000$ and BigMach is $\$ 12000$. Assuming that integer quantities of products should be produced, find the total contribution maximizing solution.

Accepted Answer

Let @#LAT-DLM& and @#LAT-DLM& be the number of uni

Question 15

Clean Energy Inc. has a planning horizon of 3 years and has 5 potential projects. Each year, the outlay required by each project is known. The amount available for investment in any of these projects each year is also assumed to be known. Each project has an associated expected contribution to total sales whose net present value is also assumed to be known. Determine the project/s that should be undertaken so as to maximize the total net present value of sales subject to budget constraints of each year.

Accepted Answer

Decision variables: Let @#LAT-DLM&, for @#LAT-DLM& to 5 , be

Question 16

A fixed charge problem typically uses $M$, which stands for a very large positive number in its formulation.

Accepted Answer

A) True 
 B)False

Question 17

Sensitivity analysis on the RHS of integer programming problems is relatively easy.

Accepted Answer

A) True 
 B)False

Question 18

A shopping complex is considering building a self-service vending machine island. The mall can buy a vending machine for dispensing various types of ready-to-pop corn. Purchase of this machine is captured by variable $\mathrm{X} 1$, taking a value of 1 and 0 if not purchased. There is also a machine available for popping any type of corn vended by the vending machine. Purchase of this machine is captured by variable X2, taking a value of 1 and 0 if not purchased. Assume that buying just one of these machines does not do much good. That is, either the mall should buy both or buy neither. The constraint that implements this will be

Accepted Answer

A)  $\mathrm{X}_{1}-\mathrm{X}_{2}$ 
A)  $\mathrm{X}_{1}-\mathrm{X}_{2}$

Question 19

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

Accepted Answer

A)  set covering problem 
B)  traveling salesman problem 
C)  knapsack problem 
D)  fixed charge problem 
A)  set covering problem 
B)  traveling salesman problem 
C)  knapsack problem 
D)  fixed charge problem

Question 20

In modeling a shopping mall construction problem, there are four potential locations giving rise to four 0-1 decision variables, denoted as $\mathrm{X}_{1}, \mathrm{X}_{2}, \mathrm{X}_{3}, \mathrm{X}_{4}$, which take a value of 1 if a mall is constructed and 0 otherwise. Identify the correct set of constraint/s to satisfy the following condition/s: at least one mall may be constructed among locations 1 and 3

Accepted Answer

A)  $\mathrm{X}_{1}+\mathrm{X}_{3} \leq$1 
B)  $\mathrm{X}_{1}+\mathrm{X}_{3} \geq$1 
C)  $X_{1}+X_{3}>$1 
D)  $X_{1}+X_{3}=$ 
A)  $\mathrm{X}_{1}+\mathrm{X}_{3} \leq$1 
B)  $\mathrm{X}_{1}+\mathrm{X}_{3} \geq$1 
C)  $X_{1}+X_{3}>$1 
D)  $X_{1}+X_{3}=$

A common feature of set covering, knapsack, and location problems is that all of them use 0-1 variables.

If a problem contains data on profit as well as cost, it cannot be formulated as an integer programming problem. We have to pick one or the other and then do the formulation.

In general, we consider more feasible solutions in solving integer linear programming problems. as compared to solving linear programming problems by simplex method. 1.

In a plant location problem with 5 potential locations, each with an associated 0-1 decision variable, $X_{1}$ , $X_{2}, X_{3}, X_{4}$ ,and $X_{5}$ , which take a value of 1 if a plant is located in that location and 0 otherwise, the constraint to make sure that at least 3 plants are put up will be

For a pure 0-1 integer programming problem with 3 variables, the maximum number of potential solutions is

A fixed charge problem typically uses $M$ , which stands for a very large positive number in its formulation.

Sensitivity analysis on the RHS of integer programming problems is relatively easy.

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

Introduction to Management Science, Modeling, and Excel Spreadsheets

Forecasting

Linear Programming: Basic Concepts and Graphical Solutions

Linear Programming: Applications and Solutions

Linear Programming: Sensitivity Analysis, Duality, and Specialized Models

Transportation, Assignment, and Transshipment Problems

Network Optimization Models

Nonlinear Optimization Models

Multi-Criteria Models

Decision Theory

Markov Analysis

Waiting Line Models

Simulation Cdrom Modules

Filters

Exam 7: Integer Programming

A common feature of set covering, knapsack, and location problems is that all of them use 0-1 variables.

If a problem contains data on profit as well as cost, it cannot be formulated as an integer programming problem. We have to pick one or the other and then do the formulation.

In general, we consider more feasible solutions in solving integer linear programming problems. as compared to solving linear programming problems by simplex method. 1.

For a pure 0-1 integer programming problem with 3 variables, the maximum number of potential solutions is

A fixed charge problem typically uses MMM , which stands for a very large positive number in its formulation.

Sensitivity analysis on the RHS of integer programming problems is relatively easy.

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

Introduction to Management Science, Modeling, and Excel Spreadsheets

Forecasting

Linear Programming: Basic Concepts and Graphical Solutions

Linear Programming: Applications and Solutions

Linear Programming: Sensitivity Analysis, Duality, and Specialized Models

Transportation, Assignment, and Transshipment Problems

Network Optimization Models

Nonlinear Optimization Models

Multi-Criteria Models

Decision Theory

Markov Analysis

Waiting Line Models

Simulation Cdrom Modules

Filters

A fixed charge problem typically uses $M$ , which stands for a very large positive number in its formulation.