ELM416 - DSS - Prof. Dr. Tarek H.

Abou-El-Enien

Exercises (2)
Chapter (2)
Linear Programming: Model Formulation and Graphical Solution
Choose the correct answer :
1) In a linear programming problem, the binding constraints for the optimal solution are:
5x1 + 3x2 ≤ 30
2x1 + 5x2 ≤ 20
Which of these objective functions will lead to the same optimal solution?
A) 2x1 + 1x2
B) 7x1 + 8x2
C) 80x1 + 60x2
D) 25x1 + 15x2

2) Decision variables:
A) measure the objective function.
B) measure how much or how many items to produce, purchase, hire, etc.
C) always exist for each constraint.
D) measure the values of each constraint.

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

A) Max Z = 5xy
B) Max Z 5x2 + 2y2
C) Max 3x + 3y + 1/3 z
D) Min (x1 + x2) / x3
Answer: C
4) Which of the following could not be a linear programming problem constraint?
A) 1A + 2B ≠ 3
B) 1A + 2B = 3
C) 1A + 2B ≤ 3
D) 1A + 2B ≥ 3

5) Which of the following could be a linear programming objective function?

A) Z = 1A + 2BC + 3D
B) Z = 1A + 2B + 3C + 4D
C) Z = 1A + 2B / C + 3D
D) Z = 1A + 2B2 + 3D

6) What is the objective function?

A) MIN 10P+15W+16F+2Y+18C
B) MAX 10P+15W+16F+2Y+18C
C) MIN 15P+20W+8F+25Y+22C
D) MAX P+1.5W+2F+2Y+3C
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

7) What is the time constraint?

A) P+1.5W+2F+2Y+3C ≤ 250
B) P+1.5W+2F+2Y+3C ≤ 80
C) 10P+15W+16F+2Y+18C ≤ 80
D) 15P+20W+8F+25Y+22C ≤ 80

8) What is the financial constraint?

A) P+1.5W+2F+2Y+3C ≤ 250
B) 15P+20W+8F+25Y+22C ≤ 250
C) 15P+20W+8F+25Y+22C ≤ 80
D) 10P+15W+16F+2Y+18C ≤ 250

9) The ________ property of linear programming models indicates that the rate of change or
slope of the objective function or a constraint is constant.
A) additive
B) divisibility
C) certainty
D) proportionality

10) The ________ property of linear programming models indicates that the values of all the
model parameters are known and are assumed to be constant.
A) additive
B) divisibility
C) certainty
D) proportionality

11) The region that satisfies all of the constraints in a graphical linear programming problem is
called the:
A) region of optimality.
B) feasible solution space.
C) region of non-negativity.
D) optimal solution space.

12) In the formulation of a ≥ constraint:

A) a surplus variable is subtracted.
B) a surplus variable is added.
C) a slack variable is subtracted.
D) a slack variable is added.

13) Which of the following statements is not true?

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.
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

14) 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:
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.

15) Which of these statements is best?

A) An unbounded problem is also infeasible.
B) An infeasible problem is also unbounded.
C) An unbounded problem has feasible solutions.
D) An infeasible problem has unbounded solutions.

16) The optimal solution to a linear programming model that has been solved using the graphical
approach:
A) is typically located at the origin.
B) must be below and on the left side of all constraint lines.
C) must be above and the right of all constraint lines.
D) is typically at some corner of the feasible region.

17) Without satisfying the non-negativity constraint, a solution that satisfies all the other
constraints of a linear programming problem is called:
A) feasible.
B) infeasible.
C) semi-feasible.
D) optimal.

18) An intern sets up a linear program to optimize the use of paper products in the men's washroom.
The system of equations he develops is:
Max 2T + 3S + 4ST
s.t
3T + 6S ≤ 40
10T + 10S ≤ 66
10T + 15S ≤ 99
His mentor studies the model, frowns, and admonishes the intern for violating which of the
following properties of linear programming models?
A) divisibility
B) proportionality
C) certainty
D) additivity
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

19) Which of the following is not a typical characteristic of a linear programming problem?
A) Restrictions exist.
B) A choice among alternatives is required.
C) The problem can be solved graphically.
D) The problem has an objective.

20) Which of the following is not a feasible schedule?

A) two trips each to Pennsylvania and Wisconsin and one trip each to Florida, New York, and
North Carolina
B) four trips each to New York and North Carolina
C) two trips each to Pennsylvania and North Carolina and one trip to Florida
D) four trips to Wisconsin and five trips to New York

21) What is the total percentage increase if the candidate makes the following schedule?
A) 10%
B) 11%
C) 12%
D) 13%

22) ________ is used to analyze changes in model parameters.

A) Optimal solution
B) Feasible solution
C) Sensitivity analysis
D) A slack variable

Lame Example Furniture Company makes two products for its adoring public: chairs (C)and tables
(T). Each chair requires 5 hours of labor (L) and 4 linear feet of rich mahogany (M), and each table
requires 3 hours of labor and 20 linear feet of rich mahogany. The company has 240 labor hours
available this week, and the warehouse has 700 linear feet of rich mahogany available. Profit for
each chair is $300 and for each table is $1500.
23) Which of the following is not a feasible production plan?
A) 35 chairs and 20 tables
B) 20 chairs and 35 tables
C) 25 chairs and 30 tables
D) 30 chairs and 25 tables

24) What is the maximum profit?

A) $52,500
B) $48,000
C) $55,000
D) $56,250
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

25) In order to maximize profit, how many tables and how many chairs should be produced?
A) T = 35, C = 0
B) T = 0, C = 48
C) T = 26.3, C = 32.8
D) T = 28.9, C = 30.7

26) The theoretical limit on the number of constraints that can be handled by a linear
programming problem is:
A) 2.
B) 3.
C) 4.
D) unlimited.

27) Consider the following maximization problem.

MAX z = x + 2y
s.t.
2x + 3y ≤ 6
5x + 6y ≤ 30
y≥1
The optimal solution:
A) occurs where x = 4.67 and y = 1.11.
B) occurs where x = 0 and y = 2.
C) occurs where x = 6 and y = 0.
D) results in an objective function value of 12.

Figure 1: 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*.
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

28) This linear programming problem shown in Figure 1 is a(n):

A) maximization problem.
B) minimization problem.
C) irregular problem.
D) cannot tell from the information given

29) The equation for constraint DH as shown in Figure 1 is:

A) 4X + 8Y ≥ 32.
B) 8X + 4Y ≥ 32.
C) X + 2Y ≥ 8.
D) 2X + Y ≥ 8.

30) Which of the following points is not feasible for the graph shown in Figure 1?
A) A
B) B
C) H
D) G

31) Which line in Figure 1 is represented by the equation 2X + Y ≥ 8?

A) BF
B) CG
C) DH
D) AJ

32) Which of the following constraints shown in Figure 1 has a surplus greater than 0?
A) BF
B) CG
C) DH
D) AJ

33) In Figure 1, the constraint AJ:

A) is a binding constraint.
B) has no surplus.
C) does not contain feasible points.
D) contains the optimal solution.
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

34) Consider the optimization problem represented by the graph in Figure 2. Which of the
following statements is best?
A) This is a maximization problem with a feasible solution.
B) This is a maximization problem with no feasible solution.
C) This is a minimization problem with a feasible solution.
D) This is a minimization problem with no feasible solution.

35) Line segment GH in Figure 2 represents the objective function. Which constraint has
surplus?
A) AB
B) CD
C) EF
D) none of the constraints has surplus

36) What is the equation for the constraint AB shown in Figure 2?

A) 3X + 12Y ≥ 15
B) X + 4Y ≥ 12
C) X + Y ≥ 15
D) 12X + 3Y ≥ 36

37) What is the equation for constraint EF shown in Figure 2?

A) 4X + 8Y ≥ 64
B) 4X + 8Y ≥ 12
C) 16X + 8Y ≥ 24
D) 16X + 8Y ≥ 32
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

38) Consider the optimization problem represented by the graph in Figure 2. The objective
function is represented by line GH. Where is the optimal solution?
A) the intersection of lines AB and EF
B) the intersection of lines AB and CD
C) the intersection of lines CD and EF
D) the upper right corner of the shaded region

39) Consider the optimization problem represented by the graph in Figure 2. Line GH represents
the objective function. Which of the following statements is best?
A) This is a single optimal solution.
B) All points along GH are optimal.
C) All points on lines AB, CD and DE that touch the shaded region are optimal.
D) All points in the shaded region are optimal

40) In order for an optimization problem to have multiple optimal solutions:

A) the objective function and one constraint must have the same y-intercept.
B) the objective function and one constraint must have the same slope.
C) two or more of the constraints must not have intersection points.
D) two or more of the constraints must have the same slope.

41) An optimization problem that has multiple optimal solutions:

A) means that there are actually no optimal solutions.
B) is reflected by the entire feasible region being optimal
C) means that the surplus for a third constraint cannot be calculated.
D) provides the decision-maker with increased flexibility.

42) How would multiple optimal solutions typically appear on a graphical solution?
A) a point
B) a line
C) a plane
D) a cube

43) Which of the following statements about infeasible problems is best?

A) All of the possible solutions violate at least one constraint.
B) All of the possible solutions violate all of the constraints.
C) At least one of the possible solutions violates all of the constraints.
D) At least one of the possible solutions violates at least one of the constraints.
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

44) Greg, a young entrepreneur, has developed an aggressive business plan and is presenting his
profit projections on the popular show Shark Tank in hopes of securing some venture capital. He
concludes his presentation with an LP model of his planned product mix, and is convinced he
will seal the deal by demonstrating that his profits are limitless since his LP model is unbounded.
What should the sharks tell him?
A) "Limitless profits sound fantastic, here's a blank check."
B) "Limitless profits are possible only in minimization models, and we want you to maximize
profits."
C) "Unlimited profits aren't possible. You must have made a mistake in your LP model."
D) "Limitless profits are possible only in maximization models, and we want you to minimize
profits."

45) Multiple optimal solutions can occur when the objective function is ________ a constraint
line.
A) unequal to
B) equal to
C) perpendicular to
D) parallel to

46) A slack variable:

A) is the amount by which the left side of a ≥= constraint is larger than the right side.
B) is the amount by which the left side of a ≤= constraint is smaller than the right side.
C) is the difference between the left and right side of a constraint.
D) exists for each variable in a linear programming problem.

The campaign manager for a doomed candidate is considering the which states to visit during the
last frenzied campaign week leading up to the nationwide election. Pennsylvania (P), Wisconsin
(W), Florida (F), New York (Y), and North Carolina (C) are all aching for one last visit, but the
candidate has only 80 hours and $250 million left in her campaign fund. A visit to Pennsylvania
takes 10 hours and costs $15 million but earns 1% of the electorate. A visit to Wisconsin takes 15
hours and costs $20 million and earns 1.5%; a visit to Florida is only $8 million but takes 16 hours
and earns 2%, and a visit to New York costs $25 million, requires 2 hours and earns 2% of the
electorate. North Carolina requires 18 hours and $22 million per trip but earns 3% of the electorate.

47) The campaign manager elects to take one trip each of Pennsylvania, Florida and North
Carolina, two trips to Wisconsin, and three trips to New York. Which resources will be completely
used?
A) only money
B) only time
C) time and money
D) neither time nor money
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

Lame Example Furniture Company makes two products for its adoring public: chairs (C)and tables
(T). Each chair requires 5 hours of labor (L) and 4 linear feet of rich mahogany (M), and each table
requires 3 hours of labor and 20 linear feet of rich mahogany. The company has 240 labor hours
available this week, and the warehouse has 700 linear feet of rich mahogany available. Profit for
each chair is $300 and for each table is $1500.

48) If the furniture company produces twenty tables and thirty-six chairs, which of the two
resources will be completely used?
A) labor only
B) rich mahogany only
C) both labor and rich mahogany
D) neither labor and rich mahogany

49) Consider the following linear program:

MAX z = 5x + 3y
s.t.
x-y≤6
x≤1
The optimal solution:
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.

50) The first step in solving a graphical linear programming model is to:
A) plot the model constraints as equations on the graph and indicate the feasible solution area.
B) plot the objective function and move this line out from the origin to locate the optimal
solution point.
C) solve simultaneous equations at each corner point to find the solution values at each point.
D) determine which constraints are binding.

51) The optimal solution of a minimization problem is at the extreme point ________ the origin.
A) farthest from
B) closest to
C) exactly at
D) parallel to

52) Multiple optimal solutions provide ________ flexibility to the decision maker.
A) greater
B) less
C) greater or equal
D) less or equal
 ELM416 - DSS - Prof. Dr. Tarek H. Abou-El-Enien

53) Which of the following special cases does not require reformulation of the problem in order
to obtain a solution?
A) unboundedness
B) infeasibility
C) alternate optimality
D) Each one of these cases requires reformulation.

54) If the feasible region for a linear programming problem is unbounded, then the solution to
the corresponding linear programming problem is ________ unbounded.
A) always
B) sometimes
C) never
D) There is not enough information to complete this statement.