802 PQ

1.
Whenever all the constraints in a linear program are expressed as equalities, the linear program is
said
TYPE THE ANSWER
2. Decision variables
TYPE THE ANSWER
3. Slack
TYPE THE ANSWER
4. Which of the following statements is NOT true?
TYPE THE ANSWER
5. Alternative optimal solutions occur when there is no feasible solution to the problem
TYPE THE ANSWER
The maximization or minimization of a quantity is
Ans;the objective of linear programming.
Decision variables tell

Ans;how much or how many of something to produce, invest, purchase,
hire, etc
Which of the following is a valid objective function for a linear

programming problem?
Ans;Min 4x + 3y + (2/3)z
Which of the following statements is NOT true?

Ans;An infeasible solution violates all constraints.
A solution that satisfies all the constraints of a linear programming

problem except the nonnegativity
constraints is called
Ans;infeasible.
Slack is
Ans; the amount by which the left side of a ≤ constraint is smaller than
the right side
To find the optimal solution to a linear programming problem using the

graphical method
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.
Ans; d. None of the alternatives is correct.
1. The improvement in the value of the objective function per unit increase
in a right-hand side is the
1. alternate optimality
2. dual price.
3. infeasible.
4. standard form
2. All of the following statements about a redundant constraint are correct
EXCEPT
1. At the optimal solution, a redundant constraint will have zero
slack
2. alternative optimal solutions.
4. An infeasible solution violates all constraints.
3. The constraint 2x1 − x2 = 0 passes through the point (200, 100).
1. F
2. objective of linear programming.
3. redundant constraint.
4. T
4. The maximization or minimization of a quantity is the
1. redundant constraint.
2. the values of the dual variables won't change
3. alternative optimal solutions.
4. objective of linear programming.
5. Which of the following is a valid objective function for a linear
programming problem?
1. At the optimal solution, a redundant constraint will have zero
slack
3. An infeasible solution violates all constraints.
4. Min 4x + 3y + (2/3)z
Which of the following special cases does not require reformulation of
the problem in order to obtain a
solution?
Ans;alternate optimality
The improvement in the value of the objective function per unit increas
in a right-hand side is the
Ans;dual price.
As long as the slope of the objective function stays between the slopes
of the binding constraints
Ans;the values of the dual variables won't change
Infeasibility means that the number of solutions to the linear

programming models that satisfies all
constraints is
Ans;0
A constraint that does not affect the feasible region is a

Ans;redundant constraint.
Whenever all the constraints in a linear program are expressed as

equalities, the linear program is said
Ans;standard form
All of the following statements about a redundant constraint are

correct EXCEPT
Ans;At the optimal solution, a redundant constraint will have zero slack
All linear programming problems have all of the following properties

EXCEPT
Ans;alternative optimal solutions.
Increasing the right-hand side of a nonbinding constraint will not cause
a change in the optimal
solution
Ans;F
In a linear programming problem, the objective function and the

constraints must be linear functions of
the decision variables
Ans;T
In a feasible problem, an equal-to constraint cannot be nonbinding.

Ans;T
Only binding constraints form the shape (boundaries) of the feasible

region
Ans;F
The constraint 5x1 − 2x2 ≤ 0 passes through the point (20, 50)
Ans;T
A redundant constraint is a binding constraint.

Ans;F
Because surplus variables represent the amount by which the solution

exceeds a minimum target, they
are given positive coefficients in the objective function.
Ans;F
Alternative optimal solutions occur when there is no feasible solution

to the problem
Ans;F
A range of optimality is applicable only if the other coefficient remains
at its original value.
Ans;T
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.
Ans;F
Decision variables limit the degree to which the objective in a linear

programming problem is
satisfied
Ans;F
No matter what value it has, each objective function line is parallel to

every other objective function
line in a problem
Ans;T
The point (3, 2) is feasible for the constraint 2x1 + 6x2 ≤ 30.
Ans;T
The constraint 2x1 − x2 = 0 passes through the point (200, 100).

Ans;F
The standard form of a linear programming problem will have the same
solution as the original
problem.
Ans;T
An optimal solution to a linear programming problem can be found at

an extreme point of the feasible
region for the problem.
Ans; True

802 PQ

Uploaded by

Copyright:

Available Formats

802 PQ

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

802 PQ

Uploaded by

Copyright:

Available Formats

1.

TYPE THE ANSWER

TYPE THE ANSWER

TYPE THE ANSWER

4. Which of the following statements is NOT true?

TYPE THE ANSWER

TYPE THE ANSWER

The maximization or minimization of a quantity is

Ans;the objective of linear programming.

Decision variables tell

Which of the following is a valid objective function for a linear

Which of the following statements is NOT true?

A solution that satisfies all the constraints of a linear programming

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

Infeasibility means that the number of solutions to the linear

A constraint that does not affect the feasible region is a

Whenever all the constraints in a linear program are expressed as

All of the following statements about a redundant constraint are

All linear programming problems have all of the following properties

In a linear programming problem, the objective function and the

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

Only binding constraints form the shape (boundaries) of the feasible

A redundant constraint is a binding constraint.

Because surplus variables represent the amount by which the solution

Alternative optimal solutions occur when there is no feasible solution

Decision variables limit the degree to which the objective in a linear

No matter what value it has, each objective function line is parallel to

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

An optimal solution to a linear programming problem can be found at

You might also like