QNT 2020 FINAL SAMPLE QUIZ 3 QUESTIONS WITH
VERIFIED ANSWERS
When using the graphical method, the region that satisfies all of the constraints of a
linear programming problem is called the
optimum solution space.
region of optimality.
profit maximization space.
feasible region
region of nonnegativity - Answers - feasible region
Constraints limit the alternatives available to a decision maker (T/F) : - Answers - True
Professor Explanation: For example: Remember the resource allocation constraints
problem with the doors and windows. We had these capacities per each plant in terms
of number of hours that they have available. Basically, these are limitations. These
constraints are limitations for decisions that can be made.
The best feasible solution is called the optimal solution (T/F) : - Answers - True
Professor Explanation: Out of all the feasible solutions, we are looking for the best
feasible solution which is called the "Optimal Solution". There can be many feasible
solutions (solutions that fit within the constraints) but the best one is the optimal one.
A feasible solution is one that satisfies all of the constraints of a linear program problem
simultaneously (T/F) : - Answers - True
Professor Explanation: We need to satisfy all of the constraints at the same time so we
can have a feasible solution.
Linear programming models may have multiple goals or objectives specified (T/F) : -
Answers - False
Professor Explanation: It can also be "= " to.
All constraints in a linear programming problem are either ≤ or ≥ inequalities. (T/F) : -
Answers - False
Professor Explanation: We can only minimize something or maximize something - but
not both at the same time. It can only have one goal or objective at a time.
, An example of decision variable in a linear programming problem is profit maximization.
(T/F) : - Answers - False
Professor Explanation: It is false because profit maximization is an objective. An
example of decision variable would be how many doors to make (from the door and
window example problem).
The equation 5x + 7y = 10 is linear. (T/F) : - Answers - True
Professor Explanation: It is linear because we are multiplying the variable (X and Y) with
numbers (integers). If we were multiplying two variables, ex: 5x7y = 10, then it would be
non-linear because we are multiplying two variables with each other(5x7y = 10 would
become 35xy = 10). It is also non-linear if we have exponents, ex: x2
The production planner for Fine Coffees, Inc. produces two coffee blends: American (A)
and British (B). He can only get 300 pounds of Colombian beans per week and 200
pounds of Dominican beans per week. Each pound of American blend coffee requires
12 ounces of Colombian beans and 4 ounces of Dominican beans, while a pound of
British blend coffee uses 8 ounces of each type of bean. Profits for the American blend
are $2.00 per pound, and profits for the British blend are $1.00 per pound. The goal of
Fine Coffees, Inc. is to maximize profits.
What is the objective function?
P = A + 2B
P = 12A + 8B
P = 2A + B
P = 8A + 12B
P = 4A + 8B - Answers - P = 2A + B
CONNECT EXPLANATION: Since the objective is to maximize profits, the objective
function should reflect the probability of A ($2.00 per pound) and B ($1.00 per pound)
The production planner for Fine Coffees, Inc. produces two coffee blends: American (A)
and British (B). He can only get 300 pounds of Colombian beans per week and 200
pounds of Dominican beans per week. Each pound of American blend coffee requires
12 ounces of Colombian beans and 4 ounces of Dominican beans, while a pound of
British blend coffee uses 8 ounces of each type of bean. Profits for the American blend
are $2.00 per pound, and profits for the British blend are $1.00 per pound. The goal of
Fine Coffees, Inc. is to maximize profits.
What is the constraint for Colombian beans?
A + 2B ≤ 4,800
12A + 8B ≤ 4,800
2A + B ≤ 4,800
8A + 12B ≤ 4,800
4A + 8B ≤ 4,800 - Answers - 12A + 8B ≤ 4,800
VERIFIED ANSWERS
When using the graphical method, the region that satisfies all of the constraints of a
linear programming problem is called the
optimum solution space.
region of optimality.
profit maximization space.
feasible region
region of nonnegativity - Answers - feasible region
Constraints limit the alternatives available to a decision maker (T/F) : - Answers - True
Professor Explanation: For example: Remember the resource allocation constraints
problem with the doors and windows. We had these capacities per each plant in terms
of number of hours that they have available. Basically, these are limitations. These
constraints are limitations for decisions that can be made.
The best feasible solution is called the optimal solution (T/F) : - Answers - True
Professor Explanation: Out of all the feasible solutions, we are looking for the best
feasible solution which is called the "Optimal Solution". There can be many feasible
solutions (solutions that fit within the constraints) but the best one is the optimal one.
A feasible solution is one that satisfies all of the constraints of a linear program problem
simultaneously (T/F) : - Answers - True
Professor Explanation: We need to satisfy all of the constraints at the same time so we
can have a feasible solution.
Linear programming models may have multiple goals or objectives specified (T/F) : -
Answers - False
Professor Explanation: It can also be "= " to.
All constraints in a linear programming problem are either ≤ or ≥ inequalities. (T/F) : -
Answers - False
Professor Explanation: We can only minimize something or maximize something - but
not both at the same time. It can only have one goal or objective at a time.
, An example of decision variable in a linear programming problem is profit maximization.
(T/F) : - Answers - False
Professor Explanation: It is false because profit maximization is an objective. An
example of decision variable would be how many doors to make (from the door and
window example problem).
The equation 5x + 7y = 10 is linear. (T/F) : - Answers - True
Professor Explanation: It is linear because we are multiplying the variable (X and Y) with
numbers (integers). If we were multiplying two variables, ex: 5x7y = 10, then it would be
non-linear because we are multiplying two variables with each other(5x7y = 10 would
become 35xy = 10). It is also non-linear if we have exponents, ex: x2
The production planner for Fine Coffees, Inc. produces two coffee blends: American (A)
and British (B). He can only get 300 pounds of Colombian beans per week and 200
pounds of Dominican beans per week. Each pound of American blend coffee requires
12 ounces of Colombian beans and 4 ounces of Dominican beans, while a pound of
British blend coffee uses 8 ounces of each type of bean. Profits for the American blend
are $2.00 per pound, and profits for the British blend are $1.00 per pound. The goal of
Fine Coffees, Inc. is to maximize profits.
What is the objective function?
P = A + 2B
P = 12A + 8B
P = 2A + B
P = 8A + 12B
P = 4A + 8B - Answers - P = 2A + B
CONNECT EXPLANATION: Since the objective is to maximize profits, the objective
function should reflect the probability of A ($2.00 per pound) and B ($1.00 per pound)
The production planner for Fine Coffees, Inc. produces two coffee blends: American (A)
and British (B). He can only get 300 pounds of Colombian beans per week and 200
pounds of Dominican beans per week. Each pound of American blend coffee requires
12 ounces of Colombian beans and 4 ounces of Dominican beans, while a pound of
British blend coffee uses 8 ounces of each type of bean. Profits for the American blend
are $2.00 per pound, and profits for the British blend are $1.00 per pound. The goal of
Fine Coffees, Inc. is to maximize profits.
What is the constraint for Colombian beans?
A + 2B ≤ 4,800
12A + 8B ≤ 4,800
2A + B ≤ 4,800
8A + 12B ≤ 4,800
4A + 8B ≤ 4,800 - Answers - 12A + 8B ≤ 4,800
