Deck 7: Integer Linear Programming

Question 1

The LP Relaxation contains the objective function and constraints of the IP problem, but drops all integer restrictions.

Answer 1

True

Question 2

If the acceptance of project A is conditional on the acceptance of project B, and vice versa, the appropriate constraint to use is a

A) multiple-choice constraint.
B) k out of n alternatives constraint.
C) mutually exclusive constraint.
D) corequisite constraint.

Answer 2

D

Question 3

The 0-1 variables in the fixed cost models correspond to

A) a process for which a fixed cost occurs.
B) the number of products produced.
C) the number of units produced.
D) the actual value of the fixed cost.

Answer 3

A

Question 4

Which of the following is the most useful contribution of integer programming?

A) finding whole number solutions where fractional solutions would not be appropriate
B) using 0-1 variables for modeling flexibility
C) increased ease of solution
D) provision for solution procedures for transportation and assignment problems

Question 5

Rounded solutions to linear programs must be evaluated for

A) feasibility and optimality.
B) sensitivity and duality.
C) relaxation and boundedness.
D) each of these choices are true.

Question 6

To perform sensitivity analysis involving an integer linear program, it is recommended to

A) use the dual prices very cautiously.
B) make multiple computer runs.
C) use the same approach as you would for a linear program.
D) use LP relaxation.

Question 7

In a model, x₁ $\ge$ 0 and integer, x₂ $\ge$ 0, and x₃ = 0, 1. Which solution would not be feasible?

A) x₁ = 5, x₂ = 3, x₃ = 0
B) x₁ = 4, x₂ = .389, x₃ = 1
C) x₁ = 2, x₂ = 3, x₃ = .578
D) x₁ = 0, x₂ = 8, x₃ = 0

Question 8

Let x₁ and x₂ be 0 - 1 variables whose values indicate whether projects 1 and 2 are not done or are done. Which answer below indicates that project 2 can be done only if project 1 is done?

A) x₁ + x₂ = 1
B) x₁ + x₂ = 2
C) x₁ - x₂ $\le$ 0
D) x₁-x₂ $\ge$ 0

Question 9

The graph of a problem that requires x₁ and x₂ to be integer has a feasible region

A) the same as its LP relaxation.
B) of dots.
C) of horizontal stripes.
D) of vertical stripes.

Question 10

In an all-integer linear program,

A) all objective function coefficients must be integer.
B) all right-hand side values must be integer.
C) all variables must be integer.
D) all objective function coefficients and right-hand side values must be integer.

Question 11

The solution to the LP Relaxation of a minimization problem will always be less than or equal to the value of the integer program minimization problem.

Question 12

Let x₁ , x₂ , and x₃ be 0 - 1 variables whose values indicate whether the projects are not done (0) or are done (1). Which answer below indicates that at least two of the projects must be done?

A) x₁ + x₂ + x₃ $\ge$ 2
B) x₁ + x₂ + x₃ $\le$ 2
C) x₁ + x₂ + x₃ = 2
D) x₁ - x₂ = 0

Question 13

Sensitivity analysis for integer linear programming

A) can be provided only by computer.
B) has precisely the same interpretation as that from linear programming.
C) does not have the same interpretation and should be disregarded.
D) is most useful for 0 - 1 models.

Question 14

Most practical applications of integer linear programming involve

A) only 0-1 integer variables and not ordinary integer variables.
B) mostly ordinary integer variables and a small number of 0-1 integer variables.
C) only ordinary integer variables.
D) a near equal number of ordinary integer variables and 0-1 integer variables.

Question 15

Rounding the solution of an LP Relaxation to the nearest integer values provides

A) a feasible but not necessarily optimal integer solution.
B) an integer solution that is optimal.
C) an integer solution that might be neither feasible nor optimal.
D) an infeasible solution.

Question 16

Modeling a fixed cost problem as an integer linear program requires

A) adding the fixed costs to the corresponding variable costs in the objective function.
B) using 0-1 variables.
C) using multiple-choice constraints.
D) using LP relaxation.

Question 17

Slack and surplus variables are not useful in integer linear programs.

Question 18

In general, rounding large values of decision variables to the nearest integer value causes fewer problems than rounding small values.

Question 19

If the optimal solution to the LP relaxation problem is integer, it is the optimal solution to the integer linear program.

Question 20

The solution to the LP Relaxation of a maximization integer linear program provides

A) an upper bound for the value of the objective function.
B) a lower bound for the value of the objective function.
C) an upper bound for the value of the decision variables
D) a lower bound for the value of the decision variables

Question 21

If Project 5 must be completed before Project 6, the constraint would be x₅- x₆ $\le$ 0.

Question 22

Your express package courier company is drawing up new zones for the location of drop boxes for customers. The city has been divided into the seven zones shown below. You have targeted six possible locations for drop boxes. The list of which drop boxes could be reached easily from each zone is listed below.
Let x_i = 1 if drop box location i is used, 0 otherwise. Develop a model to provide the smallest number of locations yet make sure that each zone is covered by at least two boxes.

Question 23

In a model involving fixed costs, the 0 - 1 variable guarantees that the capacity is not available unless the cost has been incurred.

Question 24

Dual prices cannot be used for integer programming sensitivity analysis because they are designed for linear programs.

Question 25

Tower Engineering Corporation is considering undertaking several proposed projects for the next fiscal year. The projects, the number of engineers and the number of support personnel required for each project, and the expected profits for each project are summarized in the following table:
Formulate an integer program that maximizes Tower's profit subject to the following management constraints:

Question 26

If the LP relaxation of an integer program has a feasible solution, then the integer program has a feasible solution.

Question 27

The objective of the product design and market share optimization problem presented in the textbook is to choose the levels of each product attribute that will maximize the number of sampled customers preferring the brand in question.

Question 28

The constraint x₁ + x₂ + x₃ + x₄ F $\le$ 2 means that two out of the first four projects must be selected.

Question 29

Simplon Manufacturing must decide on the processes to use to produce 1650 units. If machine 1 is used, its production will be between 300 and 1500 units. Machine 2 and/or machine 3 can be used only if machine 1's production is at least 1000 units. Machine 4 can be used with no restrictions.
(HINT: Use an additional 0 - 1 variable to indicate when machines 2 and 3 can be used.)

Question 30

Hansen Controls has been awarded a contract for a large number of control panels. To meet this demand, it will use its existing plants in San Diego and Houston, and consider new plants in Tulsa, St. Louis, and Portland. Finished control panels are to be shipped to Seattle, Denver, and Kansas City. Pertinent information is given in the table.
Develop a model whose solution would reveal which plants to build and the optimal shipping schedule.

Question 31

If x₁ + x₂ $\le$ 500y₁ and y₁ is 0 - 1, then if y₁ is 0, x₁ and x₂ will be 0.

Question 32

The constraint x₁-x₂ = 0 implies that if project 1 is selected, project 2 cannot be.

Question 33

Generally, the optimal solution to an integer linear program is less sensitive to the constraint coefficients than is a linear program.

Question 34

The classic assignment problem can be modeled as a 0-1 integer program.

Question 35

A multiple choice constraint involves selecting k out of n alternatives, where k $\ge$ 2.

Question 36

If a problem has only less-than-or-equal-to constraints with positive coefficients for the variables, rounding down will always provide a feasible integer solution.

Question 37

The product design and market share optimization problem presented in the textbook is formulated as a 0-1 integer linear programming model.

Question 38

Grush Consulting has five projects to consider. Each will require time in the next two quarters according to the table below.
Revenue from each project is also shown. Develop a model whose solution would maximize revenue, meet the time budget of 25 in the first quarter and 20 in the second quarter, and not do both projects C and D.

Question 39

Multiple choice constraints involve binary variables.

Question 40

Some linear programming problems have a special structure that guarantees the variables will have integer values.

Question 41

Kloos Industries has projected the availability of capital over each of the next three years to be $850,000, $1,000,000, and $1,200,000, respectively. It is considering four options for the disposition of the capital:
Monies not invested in these projects in a given year will NOT be available for following year's investment in the projects. The expected benefits three years hence from each of the four projects and the yearly capital outlays of the four options are summarized in the table below in $1,000,000's.
In addition, Kloos has decided to undertake exactly two of the projects, and if plant expansion is selected, it will also modernize its current facilities.
Formulate and solve this problem as a binary programming problem.