EMGT 5412

Test 1

Instructor: Dr. A. Gosavi

Time Allotted: 75 minutes

Open book and open notes. No cellphones allowed. A scientific calculator will be helpful.

PART A: (50 points; 5 points per question)

Select the best answer:

1. Consider the following linear program:
Min z = 4 x + 2 y
s.t.
5x + y ≤ 100
x + 2y ≤ 80
x ≤ 60
x,y ≥ 0
The following is true about solutions (2, 15) and (5, 4):
a. Both are feasible solutions.
b. Both are infeasible solutions
c. (2, 15) is feasible but (5, 4) is infeasible
d. (5, 4) is feasible but (2, 15) is infeasible.
2. Consider the following problem:
Max z = 4x + 6y
s.t.
x + 4y ≤ 70
x ≤ 2y
The following statement is true about the above problem.
a. The above is not a linear program because the variables are not non-negative
b. The above is a non-linear program
c. The above is a linear program because the objective function is linear and the constraints
contain no non-linear terms
d. None of the above.

3. Consider two LPs whose objective functions are defined as follows:

LP1: Max z= 4(x-2) + 5y and LP2: Max z= 4x + 5y. Both LPs have the same
constraints. The optimal solution of LP1 is known to be x*=2 and y*= 5. The
following statement must be true.

a. The optimal solution of LP2 must be: 𝑥 ∗ = −6; 𝑦 ∗ = 5.

b. The optimal solution of LP2 must be: 𝑥 ∗ = 2; 𝑦 ∗ = 5.
c. The optimal solution of LP2 cannot be determined from the information given
above.
d. None of the above.
 4. Consider the following optimization problem: Minimize 5x+ 4y such that x, y ≥ 0. The
optimal solution is:
a. Both x and y are ∞
b. The origin
c. x=0 and y = ∞
d. None of the above.

5. Consider the following problem.

Max z = 4x + 6y
s.t.
x + 4y ≤ 70
x2 ≤ 2y

The following statement is true about the above problem.

a. The above is not a linear program because the variables are not non-negative
b. The above is a linear program because the objective function is a linear function
c. The above is not a linear program because one of the constraints has a non-linear term
d. None of the above.
6. The following statement accurately describes a linear program
a. In linear programming, the optimal point is one of the corner (extreme) points
of the polygon formed by the constraints.
b. In linear programming, the optimal point is the centroid of the polygon formed
by the constraints.
c. In linear programming, the optimal point may lie outside the polygon formed
by the constraints.
d. None of the above.
7. Consider the following optimization problem: Maximize 10000x + 9y such that x, y ≥ 0.
The optimal solution is:
a. x = ∞ and y = 0
b. The origin
c. x=0 and y = ∞
d. None of the above.

8. A company produces four light fixtures (named Products A, B, C, and D) that require
both metal parts and electrical components. Management has initiated a lean
manufacturing program which mandates that one must not produce unless there is
demand. Management seeks to optimize profits while determining the product mix for
the month. For each unit of Product A, 1 unit of frame parts and 2 units of electrical
components are needed. For each unit of Product B, 3 units of frame parts and 2 units of
 electrical components are needed. For each unit of Product C, 4 unit of frame parts and
3 units of electrical components are needed. For each unit of Product D, 2 units of frame
parts and 2 units of electrical components are needed. The supplier for the company
has informed the management that in this month, they can supply 600 units of frame
parts and 300 units of electrical components. Product A costs $3 and sells at $4 while
Product B also costs $3 to produce but sells at $5. Product C costs $3 and sells at $8
while Product D costs $4 to produce and sells at $6.The demand for Product B cannot
exceed 60 units for this month, while at this time it appears that the demand for
Product A is unlimited. A linear program can be set up to determine the product mix
with following decision variables: A, B, C, and D. The objective function of the linear
program will be:
a. Minimize 3 (A+B+C)+4D
b. Maximize A + 2B + 5C + 2D
c. Maximize 4A + 5B + 8C +6D
d. None of the above
9. Two models of a product – Regular (X) and Deluxe (Y) – are produced by a company. A
linear programming model is used to determine the production schedule. The formulation
is as follows:
Maximize
50X + 60Y
profit
Subject to: 8X + 10Y 800 (labor hours)
X + Y 120 (total units
demanded)
4X + 5Y 500 (raw materials)
all variables 0

The optimal solution is X = 100; Y = 0. How many labor hours must be used optimally?

a. 800
b. 100
c. 8
d. None of the above
10. Consider two LPs whose objective functions are defined as follows:
LP1: Max z= 8x -5y and LP2: Min z= 5y – 8x. Both LPs have the same constraints.
The optimal solution of LP1 is known to be x*=20 and y*= 5. The following
statement must be true.

e. The optimal solution of LP2 must be: x*=-20; y*= -5.

f. The optimal solution of LP2 must be: x* =20; y*=5.
g. The optimal solution of LP2 cannot be determined from the information given
above.
 h. None of the above.

Part B (30 points: 10 points per question)

Select the best response

1. A furniture maker produces tables and chairs. Because of the limit on their manufacturing
capacity, they have estimated that their maximum production capacity is either 700 chairs
or 300 tables in a six-month period. The profit per chair is $20 and profit per table is $100.
Based on their market share, the maximum demand over the six-month period has been
estimated to be 500 chairs and 350 tables. The following is the linear program that can
solve this problem: Let C denote the number of chairs produced and T the number of
tables produced. (All decision variables are non-negative.) The objective function is in $.
a. Max 20C + 100 T s.t. T ≤ 300; C ≤ 700; C/7 + T/3 ≤ 100
b. Max 20C + 100T s.t. T ≤ 350; C ≤ 500; C/7 + T/3 ≤ 100
c. Max 20C + 100T s.t. T ≤ 350; C ≤ 500; C/700 + T/300 ≤ 10
d. None of the above
2. The symmetric matrix below, with four rows and four columns, provides data for the driving
distance in minutes between towns in a county. Because of the proximity of some of the towns,
a single station may serve more than one community. The stipulation is that the station must be
within 20 minutes of driving time from the towns it serves. An integer linear program can be
potentially used to solve the problem.

j
i 1 2 3 4
1 0 12 18 32
2 0 24 17
3 0 60
4 0

a. The problem has no solution.

b. A station in town 1 will serve all towns.
c. A station will be needed in all towns.
d. None of the above statements is correct.
3. An integer linear program can be set up for solving the following problem of finding the shortest
route from node 1 to node 3. If x is unknown, and the shortest route from node 1 to node 3
must involve node 4, the following must be true:

2 x
3
3 4
12 5
1
10 5 6 6
15

a. X must be greater than 10

b. X must be greater than 13
c. X must be less than 16
d. None of the above
 Part C (20 points)

Fill in the blanks:

1. The cdf of a continuous random variable is given as F(x) = x2/75 – 1/3. The random
variable assumes values between 5 and 10. The pdf must be given by:
_2x/75____________ (12 points)

2. I have a data set of discrete values. To it, I introduce a point whose value is significantly
larger than the maximum value in the data set. As a result, in all likelihood, the following
measure of central tendency (mean, median, or mode) will be most affected
____mean_______ and the following will be least affected __median or
mode_____________.
(4 points)
3. The cdf of a discrete random variable which takes four values, 2, 5, 6, and 7, is given as
follows: F(7)=1; F(6)=0.8; F(5) =0.6; and F(2) =0.1. The pdf at the four points must
assume the following values: f(2) = _0.1________; f(5) = __0.5__________; f(6) =
0.2_________; f(7) = ____0.2____.
(4 points)