Linear Programming Handout
Linear Programming Handout
Linear Programming Handout
LINEAR PROGRAMMING is a method to achieve the best outcome (such as maximum profit
or lowest cost) in a mathematical model whose requirements are represented by linear
relationships.
1. OBJECTIVE
LP algorithms require that a single goal or objective be specified.
2 TYPES: a) MAXIMIZATION- profits, revenues, efficiency
b) MINIMIZATION-cost in time, distance travelled, scrap
2. DECISION VARIABLES
These represent choices available to the decision maker in terms of amounts of either
inputs or outputs.
3. CONSTRAINTS
Constraints are limitations that restrict the alternatives available to decision makers.
3 TYPES: a) less than or equal to (≤)
b) greater than or equal to (≥)
c) equal to (=)
4. PARAMETERS
Parameters are statements consist of symbols (e.g., x1,x2) that represent the decision
variables and numerical value
Example:
1. An appliance manufacturer produces two models of electric fans: stand fans and desk
fans. Both models require fabrications and assembly work. Each stand fan uses 4 hours of
fabrication and two hours of assembly and each desk fan uses two hours of fabrication
and six hours of assembly. There are 600 fabrication hours available per week and 480
hours of assembly. Each stand fan contributes ₱400 to profits and each desk fan
contributes ₱300 to profits. How many stand fans and desk fans must the manufacturer
produce in order to maximize the profit?
Solution:
Then using the table above, the program can be formulated as follows:
2. A farmer can plant up to 8 acres of land with wheat and barley. He can earn ₱5,000 for
every acre he plants with wheat and ₱3,000 for every acre he plants with barley. His use
of a necessary pesticide is limited by federal regulations to 10 gallons for his entire 8
acres. Wheat requires 2 gallons of pesticide for every acre planted and barley requires
just 1 gallon per acre. What is the maximum profit he can make?
3. The MAM Furniture makes two products: bookcases and tables. Each bookcase
contributes ₱240 to profits and each table, ₱200. Each product passes through two
manufacturing departments, cutting and finishing. Bookcases take 4 hours a unit in
cutting and 4 hours in finishing. Tables require 3 hours a unit in cutting and 5 in
finishing. There are currently 40 hours available in cutting and 30 in finishing. Find the
product mix that will produce that maximum profit.
4. A painter has exactly 32 units of yellow dye and 54 units of green dye. He plans to mix as
many gallons as possible of color A and color B. Each gallon of color A requires 4 units
of yellow dye and 1 unit of green dye. Each gallon of color B requires 1 unit of yellow
dye and 6 units of green dye. Find the maximum number of gallons he can mix.
5. A music store assembles stereo equipment for resale in the shop. The store offers two
products; CD players and MP3 players. The store makes a profit of ₱400 on each CD
player and ₱250 on each MP3 player. Both must go through two steps: assembly and
bench-checking. A CD player takes 12 hours to assemble and 4 hours to bench check. A
MP3 player takes 4 hours to assemble but 8 hours to bench check. Looking at this
month’s schedule, the store sees that it has 60 assembly hours uncommitted and 40 hours
bench-checking time available. What combination of CD players and MP3 players would
maximize the store’s profit for the month?
6. A garden shop wishes to prepare a supply of special fertilizer at a minimal cost by mixing
two fertilizers, A and B. The mixture is to contain: at least 45 units of phosphate at least
36 units of nitrate at least 40 units of ammonium. Fertilizer A costs the shop ₱97 per
pound. Fertilizer B costs the shop ₱189 per pound. Fertilizer A contains 5 units of
phosphate and 2 units of nitrate and 2 units of ammonium. Fertilizer B contains 3 units of
phosphate and 3 units of nitrate and 5 units of ammonium. How many pounds of each
fertilizer should the shop use in order to minimize their cost?