Let: x be the number of trucks

y be the number of cars

z be the profit

The problem gave us the objective function as well as the constraints concerning the available man
hours and machine hours. Thus,

Objective Function: MAXz = 30,000x + 80,000 y

Constraints:

20x + 10y < 1,600

3x + 6y < 1,800

x>0

y>0

SOLUTION:

(Assuming the inequalities are transformed to its corresponding equalities)

Point 1: (-93.34,346.67)

[-3] [20x + 10y] = [1,600] -60x + (-30y) = -4,800

[5] [3x + 6y] = [1,800] 15x + 30y = 9,000

(as variable y will be zero it will give us) -45x = 4,200

x = -93.34

(substituting the value of x in any of two equation, we will have the value of y)

3x + 6y = 1,800

3 (-93.34) + 6y = 1,800

-280.02 + 6y = 1,800

6y = 1800 + 280.02

6y = 2080.02

y = 346.67
20x + 10y = 1,600

Point 2: (0,160) X=0 10y = 1,600

y = 160

Point 3: (80,0) y=0 20x = 1,600

X = 80

3x + 6y = 1,800

Point 4: (0,300) x=0 6y = 1,800

y = 300

Point 5: (600,0) y=0 3x = 1,800

x = 600

These points gathered are to be used in the objective function in order which numbers of trucks and
cars will give the maximum profit for the manufacturer. The points (coordinates) will substitute the
variable in the objective function which is MAXz = 30,000x + 80,000y.

a. Point 1: (-93.34,346.67) MAXz = 30,0000 (-93.34) + 80,000 (346.67)

= -2,800,200 + 27,733,600
= 24,933,400
b. Point 2: (0,160) MAXz = 30,0000 (0) + 80,000 (160)
= 0 + 12,800,000
= 12,800,000
c. Point 3: (80,0) MAXz = 30,0000 (80) + 80,000 (0)
= 2,400,000 + 0
= 2,400,00
d. Point 4: (0,300) MAXz = 30,0000 (0) + 80,000 (300)
= 0 + 24,000,000
= 24,000,000
e. Point 5: (600,0) MAXz = 30,0000 (600) + 80,000 (0)
= 18,000,000 + 0
= 18,000,000

Base on the graph, we can add another point which is (0,0) but since we knew that it will only give 0
profit too, it is understood that it cannot be part of the possible answers.
With these, we can see which among these points that represent the number of trucks and cars can give
the maximum profit. But, the solution for this does not end here. Earlier, the constraints or the
limitations are identified, thus, these should be considered.

Point 1, although gives the highest possible profit, cannot be the answer since it has given negative
value for x not satisfying one of the constraints which is x should be greater than or equal to zero.
Additionally, it does not fall within the feasible region.

Points 2, 3, 4, and 5 are the only left possible answer but we can eliminate two of these if we will base
on the graph containing the feasible region. Based on this, we will be able to see that not all of these
points lie within the feasible region where all possible answers may lie. Considering these, points 4 and 5
cannot be the possible numbers leaving us with points 2 and 3 to choose from. But since the profit from
point 2 than point 3, point 2 will be giving the numbers of trucks and cars that will generate the
maximum profit.

ANSWER: The manufacturer should manufacture zero (0) trucks and 160 cars. This will with the
maximum profit of P 12,800,000 in consideration of limited resources or constraints which are man and
machine hours.