A) tell how much or how many of something to produce, invest, purchase, hire, etc. B) represent the values of the constraints. C) measure the objective function. D) must exist for each constraint. A) tell how much or how many of something to produce, invest, purchase, hire, etc. B) represent the values of the constraints. C) measure the objective function. D) must exist for each constraint. A

Explain how to graph the line x1 -2x2 $\ge$ 0.

To graph the line 2x + 1 = 0, we can sta

A) is the difference between the left and right sides of a constraint. B) is the amount by which the left side of a $\le$ constraint is smaller than the right side. C) is the amount by which the left side of a $\ge$ constraint is larger than the right side. D) exists for each variable in a linear programming problem. A) is the difference between the left and right sides of a constraint. B) is the amount by which the left side of a $\le$ constraint is smaller than the right side. C) is the amount by which the left side of a $\ge$ constraint is larger than the right side. D) exists for each variable in a linear programming problem.

Exam 2: An Introduction to Linear Programming

Maxwell Manufacturing makes two models of felt tip marking pens. Requirements for each lot of pens are given below. Fliptop Model Tiptop Model Available Plastic 3 4 36 Ink Assembly 5 4 40 Molding Time 5 2 30 The profit for either model is $1000 per lot. a.What is the linear programming model for this problem? b.Find the optimal solution. c.Will there be excess capacity in any resource?

Free

(Essay)

4.8/5

(36)

Question 1

Correct Answer:

Verified

a.Let F = the number of lots of Fliptip pens to produce
Let T = the number of lots of Tiptop pens to produce
Max
1000F + 1000T
s.t.3F + 4T $\le$ 36
5F + 4T $\le$ 40
5F + 2T $\le$ 30
F , T $\ge$ 0
b. $a.Let F = the number of lots of Fliptip pens to produce Let T = the number of lots of Tiptop pens to produce Max 1000F + 1000T s.t.3F + 4T \le 36 5F + 4T \le 40 5F + 2T \le 30 F , T \ge 0 b. The complete optimal solution is F = 2, T = 7.5, Z = 9500, S1 = 0, S2 = 0, S3 = 5 c.There is an excess of 5 units of molding time available.$ The complete optimal solution is F = 2, T = 7.5, Z = 9500, S₁ = 0, S₂ = 0, S₃ = 5
c.There is an excess of 5 units of molding time available.

Decision variables limit the degree to which the objective in a linear programming problem is satisfied.

Free

(True/False)

4.8/5

(36)

Question 2

Correct Answer:

Verified

False

Decision variables

Free

(Multiple Choice)

4.9/5

(39)

Question 3

Correct Answer:

Verified

For the following linear programming problem, determine the optimal solution by the graphical solution method. Are any of the constraints redundant? If yes, then identify the constraint that is redundant. Max X + 2Y s.t. X + Y $\le$ 3 X- 2Y $\ge$ 0 Y $\le$ 1 X , Y $\ge$ 0

(Essay)

4.8/5

(38)

Question 4

No matter what value it has, each objective function line is parallel to every other objective function line in a problem.

(True/False)

4.8/5

(37)

Question 5

Because surplus variables represent the amount by which the solution exceeds a minimum target, they are given positive coefficients in the objective function.

(True/False)

4.8/5

(46)

Question 6

The Sanders Garden Shop mixes two types of grass seed into a blend. Each type of grass has been rated (per pound) according to its shade tolerance, ability to stand up to traffic, and drought resistance, as shown in the table. Type A seed costs $1 and Type B seed costs $2. If the blend needs to score at least 300 points for shade tolerance, 400 points for traffic resistance, and 750 points for drought resistance, how many pounds of each seed should be in the blend? Which targets will be exceeded? How much will the blend cost? Type A Type B Shade Tolerance 1 1 Traffic Resistance 2 1 Drought Resistance 2 5

(Essay)

4.7/5

(34)

Question 7

Explain how to graph the line x₁ -2x₂ $\ge$ 0.

(Essay)

5.0/5

(37)

Question 8

Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in

(Multiple Choice)

4.8/5

(24)

Question 9

Slack

(Multiple Choice)

4.8/5

(42)

Question 10

Explain what to look for in problems that are infeasible or unbounded.

(Essay)

4.8/5

(30)

Question 11

In a feasible problem, an equal-to constraint cannot be nonbinding.

(True/False)

4.8/5

(34)

Question 12

An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem.

(True/False)

4.8/5

(31)

Question 13

The point (3, 2) is feasible for the constraint 2x₁ + 6x₂ $\le$ 30.

(True/False)

4.7/5

(34)

Question 14

Solve the following system of simultaneous equations. 6X + 2Y = 50 2X + 4Y = 20

(Short Answer)

4.9/5

(23)

Question 15

The constraint 2x₁ - x₂ = 0 passes through the point (200, 100).

(True/False)

5.0/5

(38)

Question 16

Which of the following statements is NOT true?

(Multiple Choice)

4.9/5

(34)

Question 17

All linear programming problems have all of the following properties EXCEPT

(Multiple Choice)

4.9/5

(43)

Question 18

A redundant constraint is a binding constraint.

(True/False)

4.8/5

(36)

Question 19

Consider the following linear programming problem Max 8X + 7Y s.t. 15X + 5Y $\le$ 75 10X + 6Y $\le$ 60 X + Y $\le$ 8 X , Y $\ge$ 0 a.Use a graph to show each constraint and the feasible region. b.Identify the optimal solution point on your graph.What are the values of X and Y at the optimal solution? c.What is the optimal value of the objective function?

(Essay)

4.8/5

(30)

Question 20

Showing 1 - 20 of 52

Decision variables limit the degree to which the objective in a linear programming problem is satisfied.

Decision variables

For the following linear programming problem, determine the optimal solution by the graphical solution method. Are any of the constraints redundant? If yes, then identify the constraint that is redundant. Max X + 2Y s.t. X + Y $\le$ 3 X- 2Y $\ge$ 0 Y $\le$ 1 X , Y $\ge$ 0

No matter what value it has, each objective function line is parallel to every other objective function line in a problem.

Because surplus variables represent the amount by which the solution exceeds a minimum target, they are given positive coefficients in the objective function.

Explain how to graph the line x₁ -2x₂ $\ge$ 0.

Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in

Slack

Explain what to look for in problems that are infeasible or unbounded.

In a feasible problem, an equal-to constraint cannot be nonbinding.

An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem.

The point (3, 2) is feasible for the constraint 2x₁ + 6x₂ $\le$ 30.

Solve the following system of simultaneous equations. 6X + 2Y = 50 2X + 4Y = 20

The constraint 2x₁ - x₂ = 0 passes through the point (200, 100).

Which of the following statements is NOT true?

All linear programming problems have all of the following properties EXCEPT

A redundant constraint is a binding constraint.

Introduction

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance and Operations Management

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

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 2: An Introduction to Linear Programming

Decision variables limit the degree to which the objective in a linear programming problem is satisfied.

Decision variables

For the following linear programming problem, determine the optimal solution by the graphical solution method. Are any of the constraints redundant? If yes, then identify the constraint that is redundant. Max X + 2Y s.t. X + Y ≤\le≤ 3 X- 2Y ≥\ge≥ 0 Y ≤\le≤ 1 X , Y ≥\ge≥ 0

No matter what value it has, each objective function line is parallel to every other objective function line in a problem.

Because surplus variables represent the amount by which the solution exceeds a minimum target, they are given positive coefficients in the objective function.

Explain how to graph the line x1 -2x2 ≥\ge≥ 0.

Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in

Slack

Explain what to look for in problems that are infeasible or unbounded.

In a feasible problem, an equal-to constraint cannot be nonbinding.

An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem.

The point (3, 2) is feasible for the constraint 2x1 + 6x2 ≤\le≤ 30.

Solve the following system of simultaneous equations. 6X + 2Y = 50 2X + 4Y = 20

The constraint 2x1 - x2 = 0 passes through the point (200, 100).

Which of the following statements is NOT true?

All linear programming problems have all of the following properties EXCEPT

A redundant constraint is a binding constraint.

Introduction

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance and Operations Management

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

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

For the following linear programming problem, determine the optimal solution by the graphical solution method. Are any of the constraints redundant? If yes, then identify the constraint that is redundant. Max X + 2Y s.t. X + Y $\le$ 3 X- 2Y $\ge$ 0 Y $\le$ 1 X , Y $\ge$ 0

Explain how to graph the line x₁ -2x₂ $\ge$ 0.

The point (3, 2) is feasible for the constraint 2x₁ + 6x₂ $\le$ 30.

The constraint 2x₁ - x₂ = 0 passes through the point (200, 100).