Question 1

Binary variables can be used to model multiple-choice and mutually exclusive constraints.

Accepted Answer

A) True 
 B)False

Question 2

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 down to find a feasible integer solution.Is this solution optimal?
c.Find the optimal solution.

Accepted Answer

​ a. The feasible region is those intege

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

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. 
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.

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

The graph of a problem that requires x1 and x2 to be integer has a feasible region

Accepted Answer

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

Question 7

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

Accepted Answer

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

Question 8

If x1 + x2 ≤ 500y1 and y1 is 0-1,then if y1 is 0,x1 and x2 will be 0.

Accepted Answer

A) True 
 B)False

Question 9

Westfall Company has a contract to produce 10,000 garden hoses for a large discount chain.Westfall has four different machines that can produce this kind of hose.Because these machines are from different manufacturers and use differing technologies,their specifications are not the same.   ​ 
a.This problem requires two different kinds of decision variables.Clearly define each kind.
b.The company wants to minimize total cost.Give the objective function.
c.Give the constraints for the problem.
d.Write a constraint to ensure that if machine 4 is used,machine 1 cannot be.

Accepted Answer

The answer of Westfall Company has a contract to produce...

Question 10

Most practical applications of integer linear programming involve

Accepted Answer

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. 
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 11

Sensitivity analysis for integer linear programming

Accepted Answer

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 as that from linear programming and should be disregarded. 
D) is most useful for 0-1 models. 
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 as that from linear programming and should be disregarded. 
D) is most useful for 0-1 models.

Question 12

A product design and market share optimization problem involves choosing a product design that maximizes the number of consumers preferring it.

Accepted Answer

A) True 
 B)False

Binary variables can be used to model multiple-choice and mutually exclusive constraints.

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 down to find a feasible integer solution.Is this solution optimal? c.Find the optimal solution.

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

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

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

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

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

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

Most practical applications of integer linear programming involve

Sensitivity analysis for integer linear programming

A product design and market share optimization problem involves choosing a product design that maximizes the number of consumers preferring it.

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

Binary variables can be used to model multiple-choice and mutually exclusive constraints.

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 down to find a feasible integer solution.Is this solution optimal? c.Find the optimal solution.

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

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

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

The graph of a problem that requires x1 and x2 to be integer has a feasible region

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

If x1 + x2 ≤ 500y1 and y1 is 0-1,then if y1 is 0,x1 and x2 will be 0.

Most practical applications of integer linear programming involve

Sensitivity analysis for integer linear programming

A product design and market share optimization problem involves choosing a product design that maximizes the number of consumers preferring it.

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

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 down to find a feasible integer solution.Is this solution optimal? c.Find the optimal solution.

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

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