Scribd
Upload
8 views

Linear Programming - Explore 1

.

Uploaded by

clydegildo99
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Linear Programming - Explore 1

.

Uploaded by

clydegildo99
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Ex p lor e

A cti v ity
Simple Linear
Programming Problem
A bakery makes two types of cookies:
chocolate chip and oatmeal. Each
chocolate chip cookie requires 2 units of
flour and 1 unit of sugar, while each
oatmeal cookie requires 1 unit of flour and
2 units of sugar. The bakery has 10 units of
flour and 8 units of sugar available each
day. The profit for a chocolate chip cookie
is $3, and for an oatmeal cookie, it’s $4.
Objective: Maximize the bakery's profit.

Constraints:
1. 2x + y ≤ 10 (Flour constraint)
2. x + 2y ≤ 8 (Sugar constraint)
3. x ≥ 0, y ≥ 0 (Non-negative quantities)
Where:
x = number of chocolate chip cookies
y = number of oatmeal cookies
Tasks:

1. Graph these constraints.


2. Determine the feasible region.
3. Discover how to find the combination of
cookies that maximizes profit.
Graph: A straight line.
Guide in Solving the Problem
Step 1: Understand the Problem
You are tasked with maximizing profit
from producing two types of cookies
(chocolate chip and oatmeal) with limited
resources (flour and sugar).
The goal is to determine how many of each
type of cookie to make in order to
maximize profit while not exceeding
available resources.
Graph: A straight line.
Step 2: Write the Objective Function

The objective is to maximize profit, given


by the equation:
P = 3x + 4y,
where:
x = number of chocolate chip cookies.
y = number of oatmeal cookies.
Step 3: Identify the Constraints

The bakery has limited flour and sugar, so


the constraints are:

a. Flour: 2x + y ≤ 10
b. Sugar: x + 2y ≤ 8
c. Non-negativity: x ≥ 0, y ≥ 0 (You can’t
make a negative number of cookies).
Step 4: Graph the Constraints
1. Plot each constraint as a line:
For 2x + y = 10, find the intercepts (x = 0,
y = 10) and (x = 5, y = 0).
For x + 2y = 8, find the intercepts (x = 0, y
= 4) and (x = 8, y = 0).
Graph these lines on a coordinate plane.
2. Shade the feasible region: The area where the
inequalities overlap represents the set of
possible solutions.
Step 5: Find the Corner Points

The feasible region is a polygon, and the


corner points (vertices) are potential
solutions. Find the intersection points of
the boundary lines:
a. Solve for the intersection of the two
lines (e.g., 2x + y = 10 and x + 2y = 8).
b. Check the points where the lines
intersect the axes.
Step 6:

Evaluate the Objective Function

Substitute the coordinates of each corner


point into the objective function (P = 3x +
4y) to calculate the profit at each point.
Step 7: Determine the Optimal Solution
Compare the profits at each corner point.
The point that gives the highest value is the
solution to the problem.
Thank
you

You might also like