+
Related Flashcards
Cards In This Set
| Front | Back |
|
The maximization or minimization of a quantity is the
|
Objective of linear programming.
|
|
Decision variables...
|
Tell 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?a. Max 5xyb. Min 4x + 3y + (2/3)zc. Max 5x2 + 6y2d. Min (x1 + x2)/x3
|
Answer: B Min 4x + 3y + (2/3)z
|
|
Which of the following statements is NOT true?a. A feasible solution satisfies all constraints.b. An optimal solution satisfies all constraints.c. An infeasible solution violates all constraints.d. A feasible solution point does not have to lie on the boundary of the feasible region.
|
Answer: C An infeasible solution violates all constraints
|
|
A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called...
|
Infeasible
|
|
Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is...
|
0
|
|
A constraint that does not affect the feasible region is a
|
Redundant constraint
|
|
Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in...
|
Standard form
|
|
All of the following statements about a redundant constraint are correct EXCEPT 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.
|
Answer: D
|
|
All linear programming problems have all of the following properties EXCEPT a. a linear objective function that is to be maximized or minimized. b. a set of linear constraints. c. alternative optimal solutions. d. variables that are all restricted to nonnegative values.
|
Answer: C
|
|
T or F:Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution.
|
False
|
|
T or F: A redundant constraint is a binding constraint.
|
False
|
|
T or F: Decision variables limit the degree to which the objective in a linear programming problem is satisfied.
|
False
|
|
T or F: No matter what value it has, each objective function line is parallel to every other objective function line in a problem.
|
True
|
|
T or F: The point (3, 2) is feasible for the constraint 2x1 + 6x2 £ 30.
|
True
|
