The graph of a problem that requires x1 and x2 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. A) the same as its LP relaxation. B) of dots. C) of horizontal stripes. D) of vertical stripes.

In a model,x1 > 0 and integer,x2 > 0,and x3 = 0,1.Which solution would not be feasible?

A) x1 = 5,x2 = 3,x3 = 0 B) x1 = 4,x2 = .389,x3 = 1 C) x1 = 2,x2 = 3,x3 = .578 D) x1 = 0,x2 = 8,x3 = 0 A) x1 = 5,x2 = 3,x3 = 0 B) x1 = 4,x2 = .389,x3 = 1 C) x1 = 2,x2 = 3,x3 = .578 D) x1 = 0,x2 = 8,x3 = 0

Exam 11: Integer Linear Programming

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.

(True/False)

4.7/5

(29)

Question 21

Solve the following problem graphically. Max 5X + 6Y s.t.17X + 8Y < 136 3X + 4Y < 36 X,Y > 0 and integer 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.

(Essay)

4.8/5

(42)

Question 22

Solve the following problem graphically. Min 6X + 11Y s.t.9X + 3Y > 27 7X + 6Y > 42 4X + 8Y > 32 X,Y > 0 and integer 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.

(Essay)

4.8/5

(28)

Question 23

Most practical applications of integer linear programming involve

(Multiple Choice)

4.7/5

(39)

Question 24

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

(True/False)

4.8/5

(38)

Question 25

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

(True/False)

4.8/5

(34)

Question 26

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

(True/False)

4.8/5

(32)

Question 27

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

(True/False)

4.9/5

(38)

Question 28

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

(Multiple Choice)

4.9/5

(33)

Question 29

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

(Multiple Choice)

4.9/5

(40)

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.

(Essay)

4.9/5

(38)

Question 31

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?

(Multiple Choice)

4.8/5

(36)

Question 32

Modeling a fixed cost problem as an integer linear program requires

(Multiple Choice)

4.8/5

(29)

Question 33

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

(Multiple Choice)

4.7/5

(32)

Question 34

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

(True/False)

4.9/5

(28)

Question 35

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.

(Essay)

5.0/5

(38)

Question 36

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

(True/False)

4.9/5

(38)

Question 37

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

(Essay)

4.9/5

(31)

Question 38

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

(True/False)

4.8/5

(43)

Question 39

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.

(Essay)

4.9/5

(38)

Question 40

Showing 21 - 40 of 49

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.

Most practical applications of integer linear programming involve

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

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

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

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

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

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

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?

Modeling a fixed cost problem as an integer linear program requires

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

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

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

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

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility and Game Theory

Forecasting

Introduction to Linear Programming

Lp Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Distribution and Network Problems

Advanced Optimization Application

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

Exam 11: Integer Linear Programming

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.

Most practical applications of integer linear programming involve

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

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

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

If Project 5 must be completed before Project 6,the constraint would be x5 - x6 < 0.

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

In a model,x1 > 0 and integer,x2 > 0,and x3 = 0,1.Which solution would not be feasible?

Let x1 ,x2 ,and x3 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?

Modeling a fixed cost problem as an integer linear program requires

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

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

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

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

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility and Game Theory

Forecasting

Introduction to Linear Programming

Lp Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Distribution and Network Problems

Advanced Optimization Application

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

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

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

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

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

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?

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