Scribd
Upload
82 views10 pages

Linear Programming

The document discusses linear programming, which involves optimizing an objective function subject to constraints. It provides examples of linear programming problems involving maximizing profit from planting different crops within land and resource constraints, and maximizing sales of chemical ingredients subject to production constraints. The steps for solving linear programming problems are outlined, including determining decision variables, formulating the objective function and constraints, graphing the constraints, and solving using techniques like the simplex method.

Uploaded by

Gian Binondo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
82 views10 pages

Linear Programming

The document discusses linear programming, which involves optimizing an objective function subject to constraints. It provides examples of linear programming problems involving maximizing profit from planting different crops within land and resource constraints, and maximizing sales of chemical ingredients subject to production constraints. The steps for solving linear programming problems are outlined, including determining decision variables, formulating the objective function and constraints, graphing the constraints, and solving using techniques like the simplex method.

Uploaded by

Gian Binondo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Linear Programming

Solving Problems in Linear


Programming
• It is a Mathematical technique that consists of
two parts: objective function, and constraints.
• Objective function is expressed as a linear
equation involving the aggregate of some
unknown quantities (sometimes known as
decision variables).
• Constraints are expressed as linear inequalities
which are restrictions imposed on the quantities
that make up the objective function.
Solving Problems in Linear
Programming
• The objective of linear programming is to either
minimize or maximize a particular quantity.
• The unknown values is always equal to or greater
than zero.
• The optimal solution is the feasible solution that
either give the minimum or maximum value and
the minimum or maximum value itself is called
the optimum value.
• Graphing Inequalities
Examples:
1. A retiree has 60 garden plots on which he
could plant cabbage and pechay. His friends told
him that he could make a profit of 100 pesos per
plot of cabbage and 80 pesos per plot of pechay.
His household could not possibly take care of
more than 20 plots of cabbage and 40 plots of
pechay. How many plots of each vegetable
should he plant for him to have a maximum
profit? What is the maximum profit?
• A chemist makes a component of orchid fertilizer
that requires two secret ingredients labeled as A
and B. She sells ingredient A for P200 and
ingredient B for P350 per kilogram. Per production,
a kilogram of ingredient A requires 4 units of special
pollen while 3 kilograms for each kilogram of B.
Suppose the excess of ingredient B over ingredient
A per production is 4 units, and there are only 24
units of special pollen available per production, how
many kilograms of ingredient A and B should be
made per production to maximize the sales?
Steps
1. Determine the decision variables (usually
denoted by x, y, and z)
2. Formulate the objective function.
3. Determine all the restrictions or constraints.
4. Graph the inequalities (constraints)
5. Substitute the corner points to the objective
function.
2. XYZ Company in one of its minor manufacturing
plants producers speakers and headsets. The
company earns 16,500 for each speaker and 1,800
pesos per headset. Each of these products has to go
through machines A and B. Each speaker requires 5
hours in machine A and 2 hours in machine B while
each headset requires 1 hour in machine A and 1
hour in machine B. Per product cycle, Machine A can
only operate for 20 hours nonstop while machine b
can operate nonstop for only 26 hours. How many
speakers and headsets should be produced per
production cycle to maximize the company’s profit?
How much is the maximum profit?
Steps
1. Transform all to system of linear equations with
all the variables on the left and add slack
variables
2. Setup the initial matrix (augmented matrix) with
the objective function at the bottom
3. Identify the pivot column, pivot row, and pivot
element
4. Transform all the other elements in the pivot
column to zero
5. You are finished once there is no negative value
at the bottom

You might also like