Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
469 views

Unit 3 and 4 - Linear Programming-The Graphical and Simplex Method - Unit 2 and 3

The document discusses the graphical and simplex methods for solving linear programming problems, providing examples to illustrate each method. It explains how to formulate an LP problem, plot the feasible region graphically to find an optimal solution, and use the simplex method to systematically arrive at an optimal solution by moving from one corner point to another of the feasible region. Various special cases that can arise with LP problems like infeasible, unbounded, and multiple optimal solutions are also covered.

Uploaded by

Sarvar Pathan
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
469 views

Unit 3 and 4 - Linear Programming-The Graphical and Simplex Method - Unit 2 and 3

The document discusses the graphical and simplex methods for solving linear programming problems, providing examples to illustrate each method. It explains how to formulate an LP problem, plot the feasible region graphically to find an optimal solution, and use the simplex method to systematically arrive at an optimal solution by moving from one corner point to another of the feasible region. Various special cases that can arise with LP problems like infeasible, unbounded, and multiple optimal solutions are also covered.

Uploaded by

Sarvar Pathan
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/ 26

Linear Programming-The

Graphical and Simplex


Method

Maumita Roy
Graphical Solution Method

1. Plot model constraint on a set of coordinates


in a plane
2. Identify the feasible solution space on the
graph where all constraints are satisfied
simultaneously
3. Plot objective function to find the point on
boundary of this space that maximizes (or
minimizes) value of objective function
LP Model: Example

RESOURCE REQUIREMENTS
Labor Clay Revenue
PRODUCT (hr/unit) (lb/unit) ($/unit)
Bowl 1 4 40
Mug 2 3 50

There are 40 hours of labor and 120 pounds of clay


available each day

Decision variables
x1 = number of bowls to produce
x2 = number of mugs to produce
LP Formulation: Example

Maximize Z = 40 x1 + 50 x2

Subject to
x1 + 2x2 40 hr (labor constraint)
4x1 + 3x2 120 lb (clay constraint)
x1 , x2 0

Solution is x1 = 24 bowls x2 = 8 mugs


Revenue = $1,360
Graphical Solution: Example
x2
50 –

40 –
4 x1 + 3 x2 120 lb
30 –

20 – Area common to
both constraints
10 –
x1 + 2 x2 40 hr
0– | | | | | |
10 20 30 40 50 60 x1
Computing Optimal Values

x2 x1 + 2x2 = 40
40 –
4x1 + 3x2 = 120
4 x1 + 3 x2 120 lb
4x1 + 8x2 = 160
30 – -4x1 - 3x2 = -120
5x2 = 40
20 –
x1 + 2 x2 40 hr x2 = 8
10 –
8 x1 + 2(8) = 40
0– | | 24 | | x1
x1 = 24
10 20 30 40
Z = $50(24) + $50(8) = $1,360
Extreme Corner Points

x1 = 0 bowls
x2 x2 =20 mugs
x1 = 24 bowls
Z = $1,000
40 – x2 =8 mugs
Z = $1,360 x1 = 30 bowls
30 – x2 =0 mugs
20 – A
Z = $1,200

10 –
B
0– | | | C|
10 20 30 40 x1
A small scale industry manufactures electrical regulators, the
assembly of which is being accomplished by a small group of
skilled workers, both men and women.
Due to the limitations of space and finance, the number of
workers employed cannot exceed 11 and their salary bill not
more than Rs.60,000 per month. The male members of the
skilled workers are paid Rs.6000 per month, while the female
worker doing the same work as the male worker gets Rs.5000
per month.
Data collected on the performance of these workers indicate
that a male member contributes Rs.10,000 per month to total
return of the industry, while the female member contributes
Rs.8500 per month. Determine the number of male and female
workers to be employed in order to maximise the monthly total
return.
An advertising firm desires to reach two types of audiences-
customers with annual income of more than Rs.40,000 (target
audience A) and customers with annual income less than Rs.40,000
(target audience B). The total advertising budget is Rs.2,00,000. One
programme of TV advertising costs of Rs.50,000 and one programme
of Radio advertising costs Rs.20,000. Contract conditions ordinarily
require that there should be at least 3 programmes on TV and the
number of programmes on Radio must not exceed 5. Survey indicates
that a single TV programme reaches 7,50,000 customers in target
audience A and 1,50,000 in target audience B. One Radio programme
reaches 40,000 customers in target audience A and 2,60,000 in target
audience B. Formulate an LP model and solve graphically.
 Solve the LP problem graphically:

Maximize Z= 2x1 + x2
• Subject To Constraints
• x1 + 2x2 < 10
• x1 + x2 < 6
• x1 - x2 < 2
• x1 - 2x2 < 1
• x1 , x2 > 0
 A retired man wants to invest up to Rs.30,000 in fixed income
securities. His broker recommends investing in two bonds –
Bond A yielding 7% and bond B yielding 10%. After some
consideration, he decides to invest up to Rs.12000 in bond B
and not less than Rs.6000 in bond A. He also wants the amount
invested in bond A to be at least equal to the amount invested
in bond B. What should the broker recommend if the investor
wants to maximize his returns on investment. Find a graphical
solution to the given problem.
 XYZ farm is engaged in breeding pigs. The pigs are fed on
various products grown on the farm. Because of the need to
ensure certain nutrient constituents, it is necessary to buy
additional one or two products, which we shall call A and B. The
nutrient constituents in each unit of the product are given
below:

Nutrient Nutrient constituent in Minimum


constituent the product requirement of
A B nutrient
constituents
vitamins 36 6 108
proteins 3 12 36
minerals 20 10 100

 Product A costs Rs.20 per unit and product B costs Rs.40 per
unit. Determine how much of product A and B must be
purchased so as to provide the pigs nutrient not less than the
minimum required, at lowest possible cost. Solve the LP
problem graphically.
Special Cases
 Multiple optimal solution- Condition where
more than one optimal solution yield the same
objective function value.
 Two conditions to be satisfied:
 1.The slope of objective function is same as
that of the constraint forming the boundary of
the feasible solutions region.
 2.The constraint should form a boundary on
the feasible region in the direction of optimal
movement of the objective function.
 Solve the LP problem graphically:

Maximize Z= 4x1 + 8x2


• Subject To Constraints
• x1 + x2 < 10
• x2 < 15
• 3x1 + 6x2 < 18
• x1 , x2 > 0
Special Cases
 Infeasible Solution- Infeasibility is a
condition that arises when there is no
solution to a LP problem that satisfies all
the constraints.
 Unbounded Solution- When a LP
problem has no limit on the constraints, it
is said to have unbounded solution.
 Solve the LP problem graphically:

Maximize Z= 10x1 + 20x2


• Subject To Constraints
• 2x1 + x2 < 40
• 5x1 - 2x2 < 20
• x1 ≥ 25
• x1 , x2 > 0
 Solve the LP problem graphically:

Maximize Z= 15x1 + 30x2


• Subject To Constraints
• 4x1 + 8x2 ≥ 24
• 2x1 + 10x2 ≥ 15
• x1 , x2 > 0
The Simplex Method
Steps:
 Formulation of suitable LP model
 Converting the Constraints to Equations
(Write in Standard Form)
 Set up the initial solution
 Develop the initial simplex tableau
 Test of Optimality
 If needed, develop second simplex tableau
 Repeating the procedure followed earlier
 XYZ firm manufactures and sells two products Alpha and Beta.
Each unit of Alpha requires I hour of machining and two hours
of skilled labourrs, whereas each unit of Beta uses 2 hrs of
machining and 1 hr of labour. For the coming month the
machine capacity is limited to 720 machine hrs and the skilled
labour is limited to780 hrs. Not more than 320 units of Alpha
can be sold in the market during the month.
 (i) Develop a suitable model that will enable determination of
the optimal product mix.
 (ii) Determine the optimal product mix and the maximum
contribution. Unit contribution from Alpha is Rs.6 and Beta is
Rs.4.
Maximisation Case (all constraints of the type ≤ )

Following data are available for a firm which


manufactures three items A, B and C:
Time Required

Product Assembly Finishing Profit

A 10 2 800

B 4 5 600

C 5 4 300

Firm's Capacity 2000 1009

I) Express the above data in the form of linear programming problem to


maximize the profit from the production,

ii) Solve it by Simplex Method.


Minimisation Case (all constraints of the
type ≥ )

 A diet for a sick person must contain at least 4000 units


of vitamins, 50 units of minerals and 1400 units of
calories. Two foods A and B are available at a cost of
Rs.4 and Rs.3 per unit respectively. If one unit of A
contains 200 units of vitamins, 1 unit of mineral and 40
units of calories and one unit of food B contains 100
units of vitamins, 2 units of minerals and 40 units of
calories, find by simplex method, what combination of
food be used to have least cost?
A company sells a fertilizer which is made from two
chemical compounds, nitrate and phosphate. The
mixture is sold in 50 kg bags. The fertilizer is widely
used in agriculture. It has been established based on
scientific studies that the nitrate content should be at
least 20 kgs and the phosphate content should be not
more than 40 kgs in a bag of 50 kgs. The nitrate
compound costs Rs. 10 per kg and phosphate costs
Rs. 25 per kg. The company desires to determine the
mixture such that the costs of the ingredients in the
mixture is minimum.
Minimization Case (Mixed Type
Constraints)
 An animal feed company must produce 200 kg of a
mixture constituting of ingredients X1 and X2
daily.X1 costs Rs.3 per kg and X2 costs Rs.8 per kg.
No more than 80 kg of X1 can be used, and at least
60 kg of X2 must be used. Find how much of each
ingredient should be used if the company wants to
minimize cost.

You might also like