Consider the following linear fractional programming problem:

Maximize f(x)

10 3

x x

1 1

2 4

0 x2 x2

2 1

0 0

, subject to x1 3x2 50 3x1 2x2 80 and x1  0, x2  0.

(a) Transform this problem to an equivalent linear programming problem.

C

(b) Use the computer to solve the model formulated in part

(a). What is the resulting optimal solution for the original problem?