Linear Programming
Linear Programming
Linear Programming
In linear programming
Objective function and constraints are expressed as a linear
function of the variables (activities)
Linear programming uses a mathematical model in which
a linear objective function optimizes
maximizes)
(minimizes or
Par, Inc.
Par, Inc., is a small manufacture of golf equipment and
supplies whose management has decided to move into the
market for medium and high priced golf bags. Pars distributor
is enthusiastic about the new product line and has agreed to
buy all the gulf bags Par produces over the next three months.
After a through investigation of the steps involved in
manufacturing a golf bag, management determined the each
golf bag produced will require the following operations:
1. Cutting and dying the material
2. Sewing
3. Finishing
4. Inspection and packaging
Par, Inc.
Director of manufacturing analyzed each of the operations and
concluded that if the company produces a medium priced
standard model, each bag will require 7/10 hour in the cutting
and dyeing department, 1/2 hour in the sewing department, 1
hour in the finishing department and 1/10 hour in the
inspection and packaging department. The more expensive
deluxe model will require 1 hour in the cutting and dyeing, 5/6
hour for sewing, 2/3 hour for finishing and hour for
inspection and packaging. Pars production is constrained by a
limited number of hours available in each department.
Par, Inc.
After studying departmental workload projections, the director
of manufacturing estimates that 630 hours of cutting and
dyeing, 600 hours for sewing, 708 hours for finishing and 135
hours for inspection and packaging will be available for the
production of golf bags during the next three months.
Accounting department analyzed the production data, assigned
all relevant variable costs and arrived at prices for both bags
that will result in a profit contribution of $10 for every
standard bag and $9 for every deluxe bag produced. Par, Inc.,
determines the number of standard and deluxe bags to produce
in order to maximize total profit contribution.
Par, Inc.
M&D Chemicals
M&D Chemicals produces two products that are sold as raw
materials to company manufacturing bath soap and laundry
detergents. Based on an analysis of current inventory levels and
potential demand for the coming month, M&Ds management
specified that the combined production for products A and B must
total at least 350 gallons. Separately, a major customers order for
125 gallons for product A must also be satisfied. Product A
requires 2 hours of processing time per gallons and product B
requires 1 hour of processing time per gallon. For the coming
month, 600 hours of processing time is available. M&Ds
objective is to satisfy these requirements at a minimum total
production cost. Production costs are $2 per gallon for product A
and $3 per gallon for product B.
M&D Chemicals
Sensitivity Analysis
Changes in coefficients of the objective function within the specific limits
will not change the value of the decision variables but will affect the value
of the objective function.
Changes in right-hand side within the specified limits will alter the values
of both the variables and the objective function.
Dual price represents the unit worth of a resource, it gives the contribution
to the objective function resulting from a unit increase or decrease in the
availability of a resource.
LP variable is regarded as an economic activity that consumes resources
for the purpose of producing profit. Reduced cost per unit of activity =
(Cost of consumed resources per unit of activity j) - (Profit per unit of
activity j)
Sensitivity Analysis
If activitys reduced cost per unit is positive, implies value of
its associated variable in optimum solution should be zero, then
the cost of its consumed resources per unit is higher than its
profit per unit and the activity should not be undertaken.
Alternatively, an activity that is economically attractive will
have a zero reduced cost in the optimum solution, signifying an
equilibrium point has been reached at which the output (unit
profit) equals the input (unit cost of the resources).
Addition of new constraints lead to one of two cases such as
the new constraint is redundant i.e. it is satisfied by the current
optimum solution or the new constraint is violated, in which the
dual simplex method must be used to recover feasibility.
Sensitivity Analysis
Addition of a new activity in an LP model is equivalent to
adding a new variable. It is desirable only if it is profitable that
is, if it improves the optimal value of the objective function.
This condition can be checked by computing z j - cj = YPj cj
for the new activity, where Y are the current optimal dual
values and Pj and cj represent the resource usages and profit per
unit of the new activity.
If the computed zj cj satisfies the optimality condition, then
the new activity is not desirable. Otherwise, the new activity is
profitable and must be brought into the basic solution.