Question 1

Non-negativity constraints

Accepted Answer

A)   require the use of greater-than-or-equal-to constraints.
B)   restrict the decision variables to positive values.
C)   restrict the decision variables to negative values.
D)   do not restrict the sign of the decision variable.E) A) and B)
F) B) and C)

Question 2

Which of the following statements is not true?

Accepted Answer

A)   An infeasible solution violates all constraints.
B)   A feasible solution point does not have to lie on the boundary of the feasible solution.
C)   A feasible solution satisfies all constraints.
D)   An optimal solution satisfies all constraints.E) A) and D)
F) A) and C)

Question 3

Consider the following linear programming problem:
Max Z =&emsp; &emsp; $3x + $9y
Subject to: &emsp; &emsp;20x + 32y ? 1600
&emsp; &emsp;&emsp; &emsp;4x + 2y ? 240
&emsp; &emsp;&emsp; &emsp;y ? 40
&emsp; &emsp;&emsp; &emsp;x, y ? 0
Solve for the quantities of x and y which will maximize Z. What is the value of the slack variable associated with constraint 2?

Accepted Answer

x = 16, y ...

Question 4

Consider the following linear program:
MAX z = 5x + 3y
S .t. &emsp; &emsp;x - y ? 6
&emsp; &emsp;X ? 1
The optimal solution

Accepted Answer

A)   is infeasible.
B)   occurs where x = 1 and y = 0.
C)   occurs where x = 0 and y = 1.
D)   results in an objective function value of 5.E) B) and C)
F) A) and B)

Question 5

The region that satisfies all of the constraints in a graphical linear programming problem is called the

Accepted Answer

A)   region of optimality.
B)   feasible solution space.
C)   region of non-negativity.
D)   optimal solution space.E) A) and B)
F) A) and C)

Question 6

A manufacturer using linear programming to decide the best product mix to maximize profit typically has a(n) ________ constraint included in the model.

Accepted Answer

The answer of A manufacturer using linear programming to decide...

Question 7

Typically, finding a corner point for the feasible region involves solving a set of three simultaneous equations.

Accepted Answer

A) True 
 B)False

Question 8

In a linear programming problem, the binding constraints for the optimal solution are:
5x1 + 3x2 ≤ 30
2x1 + 5x2 ≤ 20
As long as the slope of the objective function stays between ________ and ________, the current optimal solution point will remain optimal.

Accepted Answer

The answer of In a linear programming problem, the binding...

Question 9

Given this set of constraints, for what objective function is the point x=5, y=3 in the feasible region?
s.t 3x + 6y ≤ 30
10x + 10y ≤ 60
10x + 15y ≤ 90

Accepted Answer

No objective functio...

Question 10

The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.
 
-The constraint AJ

Accepted Answer

A)   is a binding constraint.
B)   has no surplus.
C)   does not contain feasible points.
D)   contains the optimal solution.E) A) and B)
F) A) and C)

Question 11

In linear programming models , objective functions can only be maximized.

Accepted Answer

A) True 
 B)False

Question 12

A hot dog manufacturer wishes to minimize the cost in dollars of producing a low-cost niched product while meeting the dietary guidelines for protein and sodium. Once the model has been run, the surplus variable in the sodium constraint has a value of 1300 milligrams. The best interpretation of this outcome is:

Accepted Answer

A)   The value of the sodium in a hot dog is 1300.
B)   The amount of sodium in a single hot dog should be 1300 milligrams.
C)   The minimum cost hot dog has 1300 milligrams more sodium than required.
D)   A hot dog should have at least 1300 milligrams of sodium.E) A) and B)
F) A) and C)

Question 13

The theoretical limit on the number of constraints that can be handled by a linear programming problem is:

Accepted Answer

A)   2
B)   3
C)   4
D)   unlimitedE) All of the above
F) C) and D)

Question 14

Linear programming is a model consisting of linear relationships representing a firm's decisions given an objective and resource constraints.

Accepted Answer

A) True 
 B)False

Question 15

The feasible solution area contains infinite solutions to the linear program.

Accepted Answer

A) True 
 B)False

Question 16

In a linear programming problem, a valid objective function can be represented as:

Accepted Answer

A)   Max Z = 5xy
B)   Max Z 5x2 + 2y2
C)   Max 3x + 3y + 1/3 z
D)   Min (x1 + x2)  / x3E) B) and D)
F) B) and C)

Question 17

There is exactly one optimal solution point to a linear program.

Accepted Answer

A) True 
 B)False

Question 18

Consider the following minimization problem:
Min z = x1 + 2x2
s.t. &ensp;     x1 + x2 ? 300
&emsp; &emsp; 2x1 + x2 ? 400
&emsp; &emsp; 2x1 + 5x2 ? 750
&emsp; &emsp; x1, x2 ? 0
What is the optimal solution?

Accepted Answer

x1 = 250, ...

Question 19

Multiple optimal solutions occur when constraints are parallel to each other.

Accepted Answer

A) True 
 B)False

Question 20

A ________ is a linear relationship representing a restriction on decision making.

Accepted Answer

The answer of A ________ is a linear relationship representing...

Exam 2: Linear Programming: Model Formulation and Graphical Solution

Given this set of constraints, for what objective function is the point x=5, y=3 in the feasible region? s.t 3x + 6y ≤ 30 10x + 10y ≤ 60 10x + 15y ≤ 90

Correct Answer
verified
No objective functio...
View Answer

A ________ is a linear relationship representing a restriction on decision making.

Correct Answer
verified

A manufacturer using linear programming to decide the best product mix to maximize profit typically has a(n) ________ constraint included in the model.

Correct Answer
verified

Non-negativity constraints

Correct Answer
verified

Consider the following linear program: MAX z = 5x + 3y S .t. x - y ? 6 X ? 1 The optimal solution

Correct Answer
verified

In linear programming models , objective functions can only be maximized.

Correct Answer
verified

Consider the following linear programming problem: Max Z = $3x + $9y Subject to: 20x + 32y ? 1600 4x + 2y ? 240 y ? 40 x, y ? 0 Solve for the quantities of x and y which will maximize Z. What is the value of the slack variable associated with constraint 2?

Correct Answer
verified
x = 16, y ...
View Answer

The feasible solution area contains infinite solutions to the linear program.

Correct Answer
verified

Linear programming is a model consisting of linear relationships representing a firm's decisions given an objective and resource constraints.

Correct Answer
verified

There is exactly one optimal solution point to a linear program.

Correct Answer
verified

In a linear programming problem, a valid objective function can be represented as:

Correct Answer
verified

Consider the following minimization problem: Min z = x1 + 2x2 s.t. x1 + x2 ? 300 2x1 + x2 ? 400 2x1 + 5x2 ? 750 x1, x2 ? 0 What is the optimal solution?

Correct Answer
verified
x1 = 250, ...
View Answer

Typically, finding a corner point for the feasible region involves solving a set of three simultaneous equations.

Correct Answer
verified

Correct Answer
verified

The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*. -The constraint AJ

Correct Answer
verified

Multiple optimal solutions occur when constraints are parallel to each other.

Correct Answer
verified

Which of the following statements is not true?

Correct Answer
verified

In a linear programming problem, the binding constraints for the optimal solution are: 5x1 + 3x2 ≤ 30 2x1 + 5x2 ≤ 20 As long as the slope of the objective function stays between and , the current optimal solution point will remain optimal.

Correct Answer
verified

The region that satisfies all of the constraints in a graphical linear programming problem is called the

Correct Answer
verified

The theoretical limit on the number of constraints that can be handled by a linear programming problem is:

Correct Answer
verified

Exam 2: Linear Programming: Model Formulation and Graphical Solution

Given this set of constraints, for what objective function is the point x=5, y=3 in the feasible region? s.t 3x + 6y ≤ 30 10x + 10y ≤ 60 10x + 15y ≤ 90

Correct AnswerverifiedNo objective functio...View AnswerShow Answer

A ________ is a linear relationship representing a restriction on decision making.

Correct AnswerverifiedShow Answer

A manufacturer using linear programming to decide the best product mix to maximize profit typically has a(n) ________ constraint included in the model.

Correct AnswerverifiedShow Answer

Non-negativity constraints

Correct AnswerverifiedShow Answer

Consider the following linear program: MAX z = 5x + 3y S .t. x - y ? 6 X ? 1 The optimal solution

Correct AnswerverifiedShow Answer

In linear programming models , objective functions can only be maximized.

Correct AnswerverifiedShow Answer

Consider the following linear programming problem: Max Z = $3x + $9y Subject to: 20x + 32y ? 1600 4x + 2y ? 240 y ? 40 x, y ? 0 Solve for the quantities of x and y which will maximize Z. What is the value of the slack variable associated with constraint 2?

Correct Answerverifiedx = 16, y ...View AnswerShow Answer

The feasible solution area contains infinite solutions to the linear program.

Correct AnswerverifiedShow Answer

Linear programming is a model consisting of linear relationships representing a firm's decisions given an objective and resource constraints.

Correct AnswerverifiedShow Answer

There is exactly one optimal solution point to a linear program.

Correct AnswerverifiedShow Answer

In a linear programming problem, a valid objective function can be represented as:

Correct AnswerverifiedShow Answer

Consider the following minimization problem: Min z = x1 + 2x2 s.t. x1 + x2 ? 300 2x1 + x2 ? 400 2x1 + 5x2 ? 750 x1, x2 ? 0 What is the optimal solution?

Correct Answerverifiedx1 = 250, ...View AnswerShow Answer

Typically, finding a corner point for the feasible region involves solving a set of three simultaneous equations.

Correct AnswerverifiedShow Answer

Correct AnswerverifiedShow Answer

The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*. -The constraint AJ

Correct AnswerverifiedShow Answer

Multiple optimal solutions occur when constraints are parallel to each other.

Correct AnswerverifiedShow Answer

Which of the following statements is not true?

Correct AnswerverifiedShow Answer

In a linear programming problem, the binding constraints for the optimal solution are: 5x1 + 3x2 ≤ 30 2x1 + 5x2 ≤ 20 As long as the slope of the objective function stays between ________ and ________, the current optimal solution point will remain optimal.

Correct AnswerverifiedShow Answer

The region that satisfies all of the constraints in a graphical linear programming problem is called the

Correct AnswerverifiedShow Answer

The theoretical limit on the number of constraints that can be handled by a linear programming problem is:

Correct AnswerverifiedShow Answer

Correct Answer
verified
No objective functio...
View Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
x = 16, y ...
View Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
x1 = 250, ...
View Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

In a linear programming problem, the binding constraints for the optimal solution are: 5x1 + 3x2 ≤ 30 2x1 + 5x2 ≤ 20 As long as the slope of the objective function stays between and , the current optimal solution point will remain optimal.

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified