Question 1

A constraint that does not affect the feasible region is a

Accepted Answer

A)  non-negativity constraint. 
B)  redundant constraint. 
C)  standard constraint. 
D)  slack constraint. 
A)  non-negativity constraint. 
B)  redundant constraint. 
C)  standard constraint. 
D)  slack constraint. B

Question 2

All of the following statements about a redundant constraint are correct EXCEPT

Accepted Answer

A)  A redundant constraint does not affect the optimal solution. 
B)  A redundant constraint does not affect the feasible region. 
C)  Recognizing a redundant constraint is easy with the graphical solution method. 
D)  At the optimal solution, a redundant constraint will have zero slack. 
A)  A redundant constraint does not affect the optimal solution. 
B)  A redundant constraint does not affect the feasible region. 
C)  Recognizing a redundant constraint is easy with the graphical solution method. 
D)  At the optimal solution, a redundant constraint will have zero slack. D

Question 3

To find the optimal solution to a linear programming problem using the graphical method

Accepted Answer

A)  find the feasible point that is the farthest away from the origin. 
B)  find the feasible point that is at the highest location. 
C)  find the feasible point that is closest to the origin. 
D)  None of the alternatives is correct. 
A)  find the feasible point that is the farthest away from the origin. 
B)  find the feasible point that is at the highest location. 
C)  find the feasible point that is closest to the origin. 
D)  None of the alternatives is correct. D

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution.

Accepted Answer

A) True 
 B)False

Question 6

The improvement in the value of the objective function per unit increase in a right-hand side is the

Accepted Answer

A)  sensitivity value. 
B)  dual price. 
C)  constraint coefficient. 
D)  slack value. 
A)  sensitivity value. 
B)  dual price. 
C)  constraint coefficient. 
D)  slack value.

Question 7

Because the dual price represents the improvement in the value of the optimal solution per unit increase in right-hand-side, a dual price cannot be negative.

Accepted Answer

A) True 
 B)False

Question 8

Find the complete optimal solution to this linear programming problem.

Accepted Answer

@#IMG-DLM& The complete optima

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

Find the complete optimal solution to this linear programming problem.

Accepted Answer

@#IMG-DLM& The complete optima

Question 12

A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called

Accepted Answer

A)  optimal. 
B)  feasible. 
C)  infeasible. 
D)  semi-feasible. 
A)  optimal. 
B)  feasible. 
C)  infeasible. 
D)  semi-feasible.

Question 13

Given the following linear program:
   Solve the problem graphically. How many extreme points exist for this problem?

Accepted Answer

Two extreme points exist (Poin

Question 14

An unbounded feasible region might not result in an unbounded solution for a minimization or maximization problem.

Accepted Answer

A) True 
 B)False

Question 15

Does the following linear programming problem exhibit infeasibility, unboundedness, or alternate optimal solutions? Explain.

Accepted Answer

The proble

Question 16

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?

Accepted Answer

Let A = the pounds of Type A s

Question 17

The standard form of a linear programming problem will have the same solution as the original problem.

Accepted Answer

A) True 
 B)False

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

A range of optimality is applicable only if the other coefficient remains at its original value.

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

A) True 
 B)False

A constraint that does not affect the feasible region is a

All of the following statements about a redundant constraint are correct EXCEPT

To find the optimal solution to a linear programming problem using the graphical method

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

Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution.

The improvement in the value of the objective function per unit increase in a right-hand side is the

Because the dual price represents the improvement in the value of the optimal solution per unit increase in right-hand-side, a dual price cannot be negative.

Find the complete optimal solution to this linear programming problem.

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

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

Find the complete optimal solution to this linear programming problem.

A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called

Given the following linear program: Solve the problem graphically. How many extreme points exist for this problem?

An unbounded feasible region might not result in an unbounded solution for a minimization or maximization problem.

Does the following linear programming problem exhibit infeasibility, unboundedness, or alternate optimal solutions? Explain.

The standard form of a linear programming problem will have the same solution as the original problem.

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

A range of optimality is applicable only if the other coefficient remains at its original value.

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

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 Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Filters

Exam 2: An Introduction to Linear Programming

A constraint that does not affect the feasible region is a

All of the following statements about a redundant constraint are correct EXCEPT

To find the optimal solution to a linear programming problem using the graphical method

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

Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution.

The improvement in the value of the objective function per unit increase in a right-hand side is the

Because the dual price represents the improvement in the value of the optimal solution per unit increase in right-hand-side, a dual price cannot be negative.

Find the complete optimal solution to this linear programming problem.

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

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

Find the complete optimal solution to this linear programming problem.

A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called

Given the following linear program: Solve the problem graphically. How many extreme points exist for this problem?

An unbounded feasible region might not result in an unbounded solution for a minimization or maximization problem.

Does the following linear programming problem exhibit infeasibility, unboundedness, or alternate optimal solutions? Explain.

The standard form of a linear programming problem will have the same solution as the original problem.

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

A range of optimality is applicable only if the other coefficient remains at its original value.

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

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 Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Filters

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

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