Scribd
Upload
6 views

Linear Programming - Graphical

Linear programming is a mathematical modeling technique used to optimize a linear objective function subject to linear constraints. It involves defining decision variables, an objective function to maximize or minimize, constraints, and solving the linear program. Some common types of constraints are capacity, market, availability, quality, production technology, and blending constraints. A word problem example maximizes profit from producing two products subject to department time constraints. Another example minimizes cost of mixing two animal feeds to meet fat, protein, and calorie requirements.

Uploaded by

Francis Matthew Jimenez
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

Linear Programming - Graphical

Linear programming is a mathematical modeling technique used to optimize a linear objective function subject to linear constraints. It involves defining decision variables, an objective function to maximize or minimize, constraints, and solving the linear program. Some common types of constraints are capacity, market, availability, quality, production technology, and blending constraints. A word problem example maximizes profit from producing two products subject to department time constraints. Another example minimizes cost of mixing two animal feeds to meet fat, protein, and calorie requirements.

Uploaded by

Francis Matthew Jimenez
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

Linear Programming:

Basic Concepts
Chapter 2
Linear Programming
• Linear Programming is is a mathematical modeling
planning of activities technique in which a linear
represented by a linear function is maximized or
mathematical model. minimized when subjected to
various constraints
• Activities pertaining to (britannica.com).
operations but not limited to
profit and costs.
Steps:
1. Define the specific decision Types of Constraints:
variables. 1. Capacity constraints – these
2. Identify the objective function are limitations on the amount
which is either maximize or of equipment, space or stuff
minimize. availability.
3. List down the constraints. 2. Market Constraints – these
4. Solve are limitations on how much
5. Decision floor and ceiling can be sold
or used.
Constraints
3. Availability Constraints – 5. Production Technology or
these are limitations on the Material Balance Constraints –
available raw materials, labor, these are limitations that define
funds, or other resources (6M’s). the output of some process, int
4. Quality of Blending eh function of the inputs, often
Constraints – These are loss for scrap.
limitations on the mixes of
ingredients, usually defining the
output of products.
Maximization:
MAXIMIZE PROFIT:
P5x + P8y

SUBJECT TO:
Department 1: 3x + 4y ≤ 150
Department 2: x + 2y ≤ 60
x≥0
y≥0
Word Problem
1. To make one unit of Product A requires
three (3) minutes in department I and
one minute in department II. One unit
of Product B requires four (4) minutes
in department I and two (2) minutes in
department II. Profit contribution is
P5/unit of A and P8/unit of B. Find the
number of units of A and B, which
would be made to maximize profit if
Department I and II have 150 and 60
minutes available respectively. What
is the maximum profit?
Minimization
2. A veterinarian mixes two types of animal
feeds: Type Ko and Type Mo. Each unit of
Type Ko feeds costs P200 and contains 40
grams of fat, 20 grams of protein, and
1,600 calories. Each unit of Type Mo feeds
costs P180 and contains 60 grams of fat,
60 grams of protein, and 1,200 calories.
Suppose the veterinarian wants each unit
of the final product to yield at most 360
grams of fat, at least 240 grams of protein,
and at most 9,600 calories. How many of
each type of feeds should the veterinarian
use to minimize his cost?

You might also like