Question 1

Most practical applications of integer linear programming involve only 0-1 integer variables.

Accepted Answer

A) True 
 B)False  True

Question 2

Let x1,x2,and x3 be 0-1 variables whose values indicate whether the projects are not done (0)or are done (1).Which of the following answers indicates that at least two of the projects must be done?

Accepted Answer

A) x1 + x2 + x3 ≥ 2 
B) x1 + x2 + x3 ≤ 2 
C) x1 + x2 + x3 = 2 
D) x1 − x2 = 0 
A) x1 + x2 + x3 ≥ 2 
B) x1 + x2 + x3 ≤ 2 
C) x1 + x2 + x3 = 2 
D) x1 − x2 = 0 A

Question 3

Assuming W1,W2,and W3 are 0-1 integer variables,the constraint W1 + W2 + W3 < 1 is often called a

Accepted Answer

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

Question 4

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

Accepted Answer

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

Question 5

For the classic assignment problem,the optimal linear programming solution will consist of 0s and 1s.

Accepted Answer

A) True 
 B)False

Question 6

Consider a capital budgeting example with five projects from which to select.Let xi = 1 if project i is selected,0 if not,for i = 1,… ,5.Write the appropriate constraint(s)for each condition.Conditions are independent.
a.Choose no fewer than three projects.
b.If project 3 is chosen,project 4 must be chosen.
c.If project 1 is chosen,project 5 must not be chosen.
d.Projects cost 100,200,150,75,and 300,respectively.The budget is 450.
e.No more than two of projects 1,2,and 3 can be chosen.

Accepted Answer

Question 7

The constraint x1 − x2 = 0 implies that if project 1 is selected,project 2 cannot be.

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

Given the following all-integer linear program:   ​ 
a.​
Solve the problem as a linear program ignoring the integer constraints.Show that the optimal solution to the linear program gives fractional values for both x1 and x2.
b.​
What solution is obtained by rounding fractions greater than or equal to 1/2 to the next larger number? Show that this solution is not a feasible solution.
c.What is the solution obtained by rounding down all fractions? Is it feasible?
d.​
​
Enumerate all points in the linear programming feasible region in which both x1 and x2 are integers,and show that the feasible solution obtained in part (c)is not optimal and that in fact the optimal integer is not obtained by any form of rounding.

Accepted Answer

Question 10

The constraint x1 + x2 + x3 + x4 ≤ 2 means that two out of the first four projects must be selected.

Accepted Answer

A) True 
 B)False

Question 11

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:
a.Research and development of a promising new product
b.Plant expansion
c.Modernization of its current facilities
d.Investment in a valuable piece of nearby real estate
​
Monies not invested in these projects in a given year will NOT be available for the 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 millions of dollars.
In addition,Kloos has decided to undertake exactly two of the projects.If plant expansion is selected,it will also modernize its current facilities.
   ​
Formulate and solve this problem as a binary programming problem.

Accepted Answer

The answer of Kloos Industries has projected the availability of...

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

A business manager for a grain distributor is asked to decide how many containers of each of two grains to purchase to fill its 1,600-pound capacity warehouse.The table below summarizes the container size,availability,and expected profit per container upon distribution.​   ​ 
a.Formulate as a linear program with the decision variables representing the number of containers purchased of each grain.Solve for the optimal solution.
b.What would be the optimal solution if you were not allowed to purchase fractional containers?
c.There are three possible results from rounding an LP solution to obtain an integer solution:
(1)The rounded optimal LP solution will be the optimal IP solution.
(2)The rounded optimal LP solution gives a feasible,but not optimal IP solution.
(3)The rounded optimal LP solution is an infeasible IP solution.
​
For this problem,(i)round down all fractions; (ii)round up all fractions; and (iii)round off (to the nearest integer)all fractions (Note: Two of these are equivalent.)Which result above (1,2,or 3)occurred under each rounding method?

Accepted Answer

​ a.4/5 container of Grain A,2 container

Question 14

Given the following all-integer linear programming problem:
​
Max 3x1 + 10x2
​
s.t.2x1 + x2 1 + 6x2 1 - x2 > 2
x1,x2 > 0 and integer
​
a.Solve the problem graphically as a linear program.
b.Show that there is only one integer point and that it is optimal.
c.Suppose the third constraint was changed to x1 - x2 > 2.1.What is the new optimal solution to the LP? To the ILP?

Accepted Answer

a.x₁ = 7/3,x₂ = 1/3,objective

Question 15

Solve the following problem graphically.   ​ 
a.Graph the constraints for this problem.Indicate all feasible solutions.
b.Find the optimal solution to the LP Relaxation.Round up to find a feasible integer solution.Is this solution optimal?
c.Find the optimal solution.

Accepted Answer

The answer of Solve the following problem graphically.  ...

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

A multiple-choice constraint involves selecting k out of n alternatives,where k ≥ 2.

Accepted Answer

A) True 
 B)False

Question 18

Rounded solutions to linear programs must be evaluated for

Accepted Answer

A) feasibility and optimality. 
B) sensitivity and duality. 
C) relaxation and boundedness. 
D) All of these are correct. 
A) feasibility and optimality. 
B) sensitivity and duality. 
C) relaxation and boundedness. 
D) All of these are correct.

Question 19

In general,whenever rounding has a minimal impact on the objective function and constraints,most managers find it acceptable.

Accepted Answer

A) True 
 B)False

Question 20

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 below.​   ​
Develop a model whose solution would reveal which plants to build and the optimal shipping schedule.

Accepted Answer

The answer of Hansen Controls has been awarded a contract...

Most practical applications of integer linear programming involve only 0-1 integer variables.

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

Assuming W₁,W_2,and W₃ are 0-1 integer variables,the constraint W₁ + W₂ + W₃ < 1 is often called a

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

For the classic assignment problem,the optimal linear programming solution will consist of 0s and 1s.

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

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

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

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

Solve the following problem graphically. a.Graph the constraints for this problem.Indicate all feasible solutions. b.Find the optimal solution to the LP Relaxation.Round up to find a feasible integer solution.Is this solution optimal? c.Find the optimal solution.

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

A multiple-choice constraint involves selecting k out of n alternatives,where k ≥ 2.

Rounded solutions to linear programs must be evaluated for

In general,whenever rounding has a minimal impact on the objective function and constraints,most managers find it acceptable.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

Advanced Linear Programming Applications

Distribution and Network Models

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 7: Integer Linear Programming

Most practical applications of integer linear programming involve only 0-1 integer variables.

Let x1,x2,and x3 be 0-1 variables whose values indicate whether the projects are not done (0)or are done (1).Which of the following answers indicates that at least two of the projects must be done?

Assuming W1,W2,and W3 are 0-1 integer variables,the constraint W1 + W2 + W3 < 1 is often called a

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

For the classic assignment problem,the optimal linear programming solution will consist of 0s and 1s.

The constraint x1 − x2 = 0 implies that if project 1 is selected,project 2 cannot be.

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

The constraint x1 + x2 + x3 + x4 ≤ 2 means that two out of the first four projects must be selected.

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

Solve the following problem graphically. ​ a.Graph the constraints for this problem.Indicate all feasible solutions. b.Find the optimal solution to the LP Relaxation.Round up to find a feasible integer solution.Is this solution optimal? c.Find the optimal solution.

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

A multiple-choice constraint involves selecting k out of n alternatives,where k ≥ 2.

Rounded solutions to linear programs must be evaluated for

In general,whenever rounding has a minimal impact on the objective function and constraints,most managers find it acceptable.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

Advanced Linear Programming Applications

Distribution and Network Models

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

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

Assuming W₁,W_2,and W₃ are 0-1 integer variables,the constraint W₁ + W₂ + W₃ < 1 is often called a

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

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

Solve the following problem graphically. a.Graph the constraints for this problem.Indicate all feasible solutions. b.Find the optimal solution to the LP Relaxation.Round up to find a feasible integer solution.Is this solution optimal? c.Find the optimal solution.