Final Examination

TTE 4300 – Transportation Data Analytics

Spring 2019

Student Name: UCF ID:

INSTRUCTIONS:

 This is a CLOSED BOOK examination.

 Only one two-sided CRIB SHEET is permitted.
 STANDARD CALCULATOR permitted ONLY.
 Questions are printed on both sides of the paper
 You have 2 hour 30 minutes to solve the paper. No additional time will be provided
 Total points - 100
 You have additional points on offer (10 extra points are available)
 This examination paper MUST BE RETURNED
 Good Luck 

Problem Total Points Points Scored

1 20

2 10

3 25

4 25

5 15

6 15

Total 100 (10 bonus)

 2

Problem 1 (20 points)

Consider the following LP

Maximize Z = 3x1+4x2+2x3

subject to
x1 + x2 +x3 ≤20
x1+ 2x2+ x3 ≤30
and
x1, x2, x3 ≥0

Solve the LP using simplex method for 3 iterations or optimality whichever is earlier
 3

Problem 2 (10 points)

Write the dual for the following problem
Maximize z = 5x1 + 12x2+ 4x3
Subject to
x1+2x2+x3≤10
2x1-x2+3x3 =8
x1 unrestricted, x2 ≤0, x3 ≥0
 4

Problem 3 (25 points)

Consider the following LP
Minimize Z = 3x1+2x2+3x3
Such that
x1+4x2+x3 ≥7
2x1+x2+x4≥10
x1, x2, x3, x4 ≥0

Apply Simplex method without introducing artificial variables and find the optimal solution (Z
and x1, x2, x3 and x4)
 5

Problem 4 (25 points)

Consider the following problem.

Maximize Z = 3x1 + x2 + 2x3,

subject to
x1 - x2 + 2x3 ≤ 20
2x1 + x2 - x3 ≤ 10
and
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

Let x4 and x5 denote the slack variables for the constraints. After we apply the simplex method, the
final simplex tableau is

Coefficient of:
Basic Eq. Right
Variable Z x1 x2 x3 x4 x5 Side
Z (0) 1 8 0 0 3 4 100
x3 (1) 0 3 0 1 1 1 30
x2 (2) 0 5 1 0 1 2 40

Answer the following questions based on this information

a) Determine the optimal basis and provide the values for all decision variables (3 points)
b) Is resource for the first constraints (b1=20) a sensitive parameter; explain the rationale for
your answer (4 points)
c) What will happen to the solution if the coefficient of x1 in objective function becomes 5
i.e. will the current solution remain optimal (12 points)
d) What will happen if the coefficient of x1 in constraint 2 becomes 1 (6 points)
 6

Problem 5 (15 points)

Consider the following LP

Max. 25x1+20x2
s.t. 3x1+4x2≤100
8x1+5x2≤60
x1 and x2 non-negative, let x3 and x4 be slack variables

We are informed that x2 and x3 are the optimal basis.

a) Consider that the table below is the optimal simplex table with information that x2 and x3
are basic variables. Enter values of all elements in the table that you can compute. Some
elements might be undeterminable – if so say that. (12 points)

Note: You cannot use the simplex method – use the information on the optimal basis to figure this
out. I will not give points if you do not convince me that you generated this information from the
basis.

x1 x2 x3 x4 RHS
Z
x2
x3

b) Given you can purchase additional resources (i.e. more of resource 1 (currently 100) or
resource 2 (currently 60)), which resource would you choose to buy (3 points)
 7

Problem 6 (15 points)

Solve the following LP problem to optimality (or 3 iterations)

Minimize Z = -x1 + 9x2 - x3,

subject to
-x1 + 2x2 - 3x3 ≥ -9
3x1 - 2x2 + 2x3 ≤ 15
and
x1 ≥ 0, x2 ≤ 0, x3 ≥ 0.