Activity No.

2
Linear Programming: Graphical Method
Maximization Problem

NAME: FAINA, SOPHIA MAE F. DATE: MARCH 11, 2022

YR. & SEC.: BSBA-1A SCORE: ______ RATING: ______

I. Solve the Linear Programming Models

1. Maximize: P = 13x1 + 6x2

Subject to: x1 + 2x2 ≤ 8
2x1 + 2x2 ≤ 16
x1 ≥ 0, x2 ≥ 0

2. Maximize: P = 16x1 + 11x2

Subject to: x2 ≥ 14
2x1 + x2 ≤ 30
x1 + 2x2 ≤ 34
x1 ≥ 0, x2 ≥ 0

II. Establish and solve the linear programming model of the following:
3. A souvenir store wishes to produce two models of souvenirs: model A and model B. Every
model-A souvenir will result to Php 14 profit, and every model-B souvenir will result to Php 23
profit. To manufacture a model-A souvenir requires 3 minutes on stage 1 and 6 minutes on
stage 2. A model-B souvenir requires 5 minutes on stage 1 and 4 minutes on stage 2. There
are 270 minutes on stage 1 and 360 minutes on stage 2 for processing order. How many
souvenirs of each model should the store make in order to maximize the profit?
4. A table manufactures produces tables in two types: regular and deluxe. It costs Php 300 to
make each regular table, which sells for Php 550. It costs Php 480 to make each deluxe table
and each sells for Php750. The daily production capacity is 125 tables and the daily cost
cannot exceed Php 60,000. How many tables of each type should be made per day to
maximize profit?
5. Bryan’s Bakery bakes two breads, A and B. One batch of A uses 5 pounds of oats and 3
pounds of flour. One batch of B uses 2 pounds of oats and 3 pounds of flour. The company
has 180 pounds of oats and 135 pounds of flour available. Bryan’s Bakery wants to maximize
its profits from bread sales. One batch of A yields a profit of $40. One batch of B yields a profit
of $30. Find how many batches of each bread the bakery should bake.