Question 1

In a 0-1 integer programming model, if the constraint x1 - x2 ≤ 0, it means when project 2 is selected, project 1 ________ be selected.

Accepted Answer

A)  must always 
B)  can sometimes 
C)  can never 
D)  is already

Question 2

In a ________ integer programming model, a solution of x2 = 7 is not possible.

Accepted Answer

The answer of In a ________ integer programming model, a...

Question 3

If exactly three projects are to be selected from a set of five projects, this would be written as three separate constraints in an integer program.

Accepted Answer

A) True 
 B)False

Question 4

The Exorbitant Course Fees. The $75 per credit hour course fee tacked on to all the MBA classes has generated a windfall of $56,250 in its first semester. "Now we just need to make sure we spend it all," the Assistant Dean cackled. She charged the Graduate Curriculum Committee with generating a shopping list before their next meeting. Four months later, the chairman of the committee distributed the following. As the professor for the quantitative modeling course, he tended to think in terms of decision variables, so he added the left-most column for ease of use.
 $$\begin{array} { | c | l | l | l | } 
\hline \begin{array} { l } 
\text { Decision } \
\text { Variable }
\end{array} & \text { Item } & \text { Cost } & \text { Note } \
\hline \text { A } & \text { iPads for everybody } & \$ 750 / \text { unit } & \text { Must get a cover if these are purchased } \
\hline \text { B } & \text { iPad covers with MBA logo } & \$ 25 / \text { unit } & \text { Not needed unless we buy iPads } \
\hline \text { C } & \text { Speaker series } & \$ 15,000 & \text { Can't afford both this and the iPads } \
\hline \text { D } & \begin{array} { l } 
\text { Subscriptions to the Wall } \
\text { Street Joumal }
\end{array} & \$ 10 / \text { unit } & \text { Don't need if we have the electronic version } \
\hline & \begin{array} { l } 
\text { Subscriptions to the } \
\text { electronic version of the Wall }
\end{array} & & \
\text { E } & \begin{array} { l } 
\text { Street Joumal }
\end{array} &\$5/unit& \text { Worthless without the iPads } \
\hline
\end{array}$$
-Which of the following constraints best describes the relationship between the electronic Wall Street Journal subscription and the iPads?

Accepted Answer

A)  E - A = 0 
B)  E - A = 1 
C)  E - A ? 0 
D)  E - A ? 1

Question 5

If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a ________ constraint.

Accepted Answer

The answer of If we are solving a 0-1 integer...

Question 6

You have been asked to select at least 3 out of 7 possible sites for oil exploration. Designate each site as S1, S2, S3, S4, S5, S6, and S7. The restrictions are: Restriction 1. Evaluating sites S1 and S3 will prevent you from exploring site S7. Restriction 2. Evaluating sites S2 or S4 will prevent you from assessing site S5. Restriction 3. Of all the sites, at least 3 should be assessed. Assuming that Si is a binary variable, write the constraint(s) for the second restriction.

Accepted Answer

The answer of You have been asked to select at...

Question 7

In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected, project 1 cannot be selected.

Accepted Answer

A) True 
 B)False

Question 8

If the solution values of a linear program are rounded in order to obtain an integer solution, the solution is

Accepted Answer

A)  always optimal and feasible. 
B)  sometimes optimal and feasible. 
C)  always feasible. 
D)  never optimal and feasible.

Question 9

Binary variables are

Accepted Answer

A)  0 or 1 only. 
B)  any integer value. 
C)  any continuous value. 
D)  any negative integer value.

Question 10

The three types of integer programming models are total, 0-1, and mixed.

Accepted Answer

A) True 
 B)False

Question 11

Max Z = &emsp; x1 + 6x2 
Subject to:&emsp;17x1 + 8x2 ? 136 
	&emsp; &emsp;&emsp;  3x1 + 4x2 ? 36 
&emsp; &emsp;&emsp;x1, x2 ? 0 and integer

Find the optimal solution.

Accepted Answer

The answer of  
 Max Z = &emsp; x1...

Question 12

If we graph the problem that requires x1 and x2 to be an integer, it has a feasible region consisting of ________.

Accepted Answer

The answer of If we graph the problem that requires...

Question 13

Saba conducts regular tours of his favorite city in the world, Paris. Each semester he selects among the finest students in the university and escorts them to the City of Lights. In addition to a world-class education on conducting business in Europe, he arranges a number of cultural outings for them to help them immerse themselves in all that France has to offer. He collects an extra $100 from each student for this purpose and limits his tour group to ten lucky individuals. Some of the events (and their prices) he proposes to the students include:
Eiffel Tower visit, $40 per student, E
Paris Sewer spelunking, $20 per student, S
Half day passes to the Louvre, $60 per student, L
Bon Beret tour, $50 per student, B
So much to do and so little time!
-The tour group has three days remaining in Paris and the opportunity to do three cultural events. It is important to soak up as much culture as possible, so Saba decides to model this as a 0-1 integer program mandating that the group does three events. A couple of students object, not to the integer program, but to the set of cultural events that they have to choose from. They would rather have the option to do up to three events but perhaps only one or two and spend the rest of their time doing some "retail benchmarking." What was Saba's original constraint and how does that constraint change to cater to the whims of the students?

Accepted Answer

The answer of Saba conducts regular tours of his favorite...

Question 14

Consider a capital budgeting example with five projects from which to select. Let x1 = 1 if project a is selected, 0 if not, for a = 1, 2, 3, 4, 5. Projects cost $100, $200, $150, $75, and $300, respectively. The budget is $450.
-Write the appropriate constraint for the following condition: If project 1 is chosen, project 5 must not be chosen.

Accepted Answer

The answer of Consider a capital budgeting example with five...

Question 15

The ________ method is based on the principle that the total set of fesible solutions can be partitioned into smaller subsets of solutions.

Accepted Answer

The answer of The ________ method is based on the...

Question 16

Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj = 1 if project j is selected and xj = 0, otherwise.
The constraint (x1 + x2 + x3 + x4 = 2) means that ________ out of the ________ projects must be selected.

Accepted Answer

A)  exactly 1, 2 
B)  exactly 2, 4 
C)  at least 2, 4 
D)  at most 1, 2

Question 17

In a ________ integer model, some solution values for decision variables are integers and others can be non-integer.

Accepted Answer

A)  total 
B)  0-1 
C)  mixed 
D)  all of the above

Question 18

The branch and bound method of solving linear integer programming problems is

Accepted Answer

A)  an integer method. 
B)  a relaxation method. 
C)  a graphical solution. 
D)  an enumeration method.

Question 19

If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a conditional constraint.

Accepted Answer

A) True 
 B)False

Question 20

In a ________ integer model, the solution values of the decision variables are 0 or 1.

Accepted Answer

A)  total 
B)  0-1 
C)  mixed 
D)  all of the above

Exam 5: Integer Programming

In a 0-1 integer programming model, if the constraint x1 - x2 ≤ 0, it means when project 2 is selected, project 1 ________ be selected.

In a ________ integer programming model, a solution of x2 = 7 is not possible.

If exactly three projects are to be selected from a set of five projects, this would be written as three separate constraints in an integer program.

If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a ________ constraint.

In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected, project 1 cannot be selected.

If the solution values of a linear program are rounded in order to obtain an integer solution, the solution is

Binary variables are

The three types of integer programming models are total, 0-1, and mixed.

Max Z = x1 + 6x2 Subject to: 17x1 + 8x2 ? 136 3x1 + 4x2 ? 36 x1, x2 ? 0 and integer Find the optimal solution.

If we graph the problem that requires x1 and x2 to be an integer, it has a feasible region consisting of ________.

The ________ method is based on the principle that the total set of fesible solutions can be partitioned into smaller subsets of solutions.

Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj = 1 if project j is selected and xj = 0, otherwise. The constraint (x1 + x2 + x3 + x4 = 2) means that out of the projects must be selected.

In a ________ integer model, some solution values for decision variables are integers and others can be non-integer.

The branch and bound method of solving linear integer programming problems is

If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a conditional constraint.

In a ________ integer model, the solution values of the decision variables are 0 or 1.

Exam 5: Integer Programming

In a 0-1 integer programming model, if the constraint x1 - x2 ≤ 0, it means when project 2 is selected, project 1 ________ be selected.

In a ________ integer programming model, a solution of x2 = 7 is not possible.

If exactly three projects are to be selected from a set of five projects, this would be written as three separate constraints in an integer program.

If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a ________ constraint.

In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected, project 1 cannot be selected.

If the solution values of a linear program are rounded in order to obtain an integer solution, the solution is

Binary variables are

The three types of integer programming models are total, 0-1, and mixed.

Max Z = x1 + 6x2 Subject to: 17x1 + 8x2 ? 136 3x1 + 4x2 ? 36 x1, x2 ? 0 and integer Find the optimal solution.

If we graph the problem that requires x1 and x2 to be an integer, it has a feasible region consisting of ________.

The ________ method is based on the principle that the total set of fesible solutions can be partitioned into smaller subsets of solutions.

Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj = 1 if project j is selected and xj = 0, otherwise. The constraint (x1 + x2 + x3 + x4 = 2) means that ________ out of the ________ projects must be selected.

In a ________ integer model, some solution values for decision variables are integers and others can be non-integer.

The branch and bound method of solving linear integer programming problems is

If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a conditional constraint.

In a ________ integer model, the solution values of the decision variables are 0 or 1.

Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj = 1 if project j is selected and xj = 0, otherwise. The constraint (x1 + x2 + x3 + x4 = 2) means that out of the projects must be selected.