Simplex
Simplex
a resources,
Since if toare For that
simplex Step Step if
variable
inequality For problem. The and
Thevariables
variants The
the answers constraints.
introduced the xzis
a all The a simplex application simplex
number simplex given constraint involved?
Does costthe extent?
If Would What What
table.
solutionequations II is All All to
I the the For the can
unrestricted
to is the
ObtainingStandardization solution reversed. method the problem mix method
handle
of
method, to be values
variablesapplying the canquestions
in The convert problem of
a are constraints. unrestricted involving optimal
maximum of the
b; unutilised, on is the
SIMPLEX
METHOD
obtained,
simplexvalues
the is Simplex any is
in in a a
the the Thus, the step-by-step have of products like: very
sign, minimisation mix complexities
the constraints
" to a RHS the simplex profit
tableau, are In in negative problem an fully method powerful
writing are type constraintit
written constraints
a <type
only: the sign, is of alternate involved
be
simplex replaced constraints method utilise
obtained
Initialworthless, of
it of it b; procedure for intool
inequalities are are
isvariable the
Maximisation may value, type, all would solving
necessary on 2x, non-negative, to solution? the for LPP- II
the solution, first be by solving resources, from
Table: problem: -7x, what solving
LPPs
replaced the it are for yield a
RHS names the expressed is
non-negative. finding mix the linear
1 profitslack into difference>-66
multiplied a the
irrcspectivelinear
to of linear of or
optimal
look the on equations.The in and are programming
as the products maximum
variables
the contribution the would programming
for table equations. between programming there
top problem on optimal profit
an of
be
each would any profit? the
identity and row type mix?
represent replaced solution unutilised problem number
the and given number The bytwo side
minimise problems.
matrix c; the x4
non-negative problem,
values to slack problems - by
X5, as-1, to helpg and
a,;values the the of resources,
slack a The
within slack variables where -2x, and linear
it the nature
in respective
has cost manager a simplex
the variables. +the
variablesvariables x4, 7x, to
programming
he below
tbottom and and of
S, Xs>0. direction
> be
matrix constraint. to to decision and
it ,S, with 66. ensured what know
Thus, what its
row. draw is equal isand If
of zero. is
S3 a of
a;i To up
Operationr Rerearch ihn onn
values. In thesc pblens the dontity 1atn 1s onlk mnde up f the slanck
vauable The Variableg
Onst1tuting the denutr matriN (slac vanahles in th1s cae) are then entered on the basis in
the same
onder in wheh ther eld the matm Along with then, ther
coeffcients in thr objecive function are
enterd. Fimall.the snluton s wtetn in a on helo the c, alues. Gach of the
vaiables in the basis is
asStgned the mrsOndmg walue im the b, olumn whle the rmaunng vanables are all set
cqunl to 2ero.
Anew simpiex tabie is ohtained. For obtain1ng a new table. first. derive the row corresponding to the key
row by dincing each eiement by the key element (w hich lies at the intersection of the key column and
key row). For every other element of the matrix. use the rule:
New element = 0ld clcmcnt Corresponding clcment X Corresponding element in key row in key column
Key element
The revised solutton obta:ned from the new tableau is also tested for optimality. Similar improvements in
the solutions are done until an opimal solution is reached.
Economic Interpretation:
Besides indicating optimality, the A, row values in the final table give significant information the
shadow prices. value. worth. or marginal profitability of the resources. The value of z, indicates the
amount of profit that cach of the column heads should yield. It should be either equal to or less than cvalue.
The basis can be understood as inventory. When the production process begins, the inventory has
unutilised resources, i.e. slack variables. As the method progresses, slack variables are replaced by decision
variables. The economical interpretation is that the resources are consumed to produce products. If any
slack variable is present in the optimal table, it indicates the unutilised capacity of the resource. Theso
resources are worthless, and they have shadow prices (A;) is equal to zero.
2
Operatlons Research Riha Anrna
Degeneracy
tero value
mor baar wariahlig Aa9ume
Degenoracv in LPP orrura when one or
Big -M Method
inequal1ties are types
const rained by reuirements, the
Since the minimiaation type problem ig mized constraInts <, and =), The Big M
prohlens with
Moreover. there can he maximisation typea
ronstrant# ara iven. It follow the following steps:
method is used for the problema where or =
Initial Table:
Step II Obtaining the writing up
variable names on the top row and the a,.valies below it draw
Once all equations are obtained,
the c, values in the bottom row.
a simplex tableau. The b, values are written on the RHS of the tableau and
values are :dentified.
To obtain a solution in a simplex tableau, an identity matrix within the matrx of a,,
enter the
Here, the identity matrix is a combination of slack and artificial vartables, and the varables
basis in the same order in which they yield the matrix. A\lorg with them, their coefherents in the object1ve
function are entered. Finally, the solution is written in a row below the , values, Each of the vartables n
the basis is assigned the corresponding value in the b; column wh:le the remain1ng vanables are all set
equal to zero.
The reyised solution obtained from the new tableau is also tested for optimality. Similar improvements in
the solutions are done until an optimal solution is reached.
3
Operations Research |Richa
identity matrix.
Infeasibility
table.
solution is infeasible if an artifcialvariable is present in the basis of the optimal
1he
Unboundedness
An LPP is said to have an unbounded solution if its objective function value can be increased (in case of
maximisation problem) or decreased (in case of minimisation type problems without limit. The soltion is
unbound if there is no non-ne gative ratio to select for the outgoing variable.
Practice Problems
10. A company produces three products, P. Q and R. from (yo raw mnterials, A and B and labour L. One
unit of product P requires one unit of A, 3 units of Band2 mits of ,. One nit of product Qrequires 2
units of Aand Beach and3 units of L. while one unit of product R requires 2 units of A, G nitsof B
and 4 units of L. the company has daily availabiity of 8 units of A. 12 units of B and 12 units ofl. It is
futher nown that the product unit contibution marginfor P. Qnd Ris 23, 2 and 5, respectively.
(a) Formulate this problem as a linear programming problenm, then sole it todetermine the optimum
product mix.
(6) Is the solution obtained by vou unigue? ldentiy an altenate solution, ifany.
1; S 125
3x, + 6.x, S 900
14. A timber merchant manufactures three types of plywood. The data below give the production horsper
unit in each of the three production operations, maximum time available, and profit per unit.
Operations (Hours)
Plywood Profit per unit ()
III
Grade A 2 4 40
Grade B 5 5 2 30
Grade C 10 3 2 20
Max time available 900 400 600
How many units of each grade of plywood should be produced to maximise the total profit? Verify the
optimal solution using shadow prices.
6
16. Solve the following uaing the simplex
Operations Research ha Puorna
method:
Min 7 = 150x, + 150x, + 100x,
Subject to
2x, +3x, t x,2 4
3x, +2x, + x,23
17. Minimise Z= x, t x2
Subject to
2x, +x>4
x1 +7x, >7
7
Operations Rerearch isha famna
a, -21, =18
;0
25. A chemical companv manufactures three chemicals A Band C. sold to manufacturers of soaps and
detergents. Based on the next month's demand. the nanagennent has decided tlhat the total production
tor chenmicals A. Band Cshould be at least 350 kg. Amajor customer has confirnmed the order of product
Afor 125 kg. Product Arequires two hours of prvcessing. and product Band Ceach requires one hour
OT processing time per kg. The company wants to use at least 600 hours of processing time for the
coming month. The company wants to meet the requirement at a minimum production cost. The
production costs are R5 per kg for product A. t4 per kg for product B, and 6 per kg for product .
Formulate this problem as LPP andsolve it using the simplex method.
26. One gram of soybean meal prorides at least 2.5 units of vitamins and 5 calories. One gram of meat
provides at least 4.5 units of vitamins and 3 calories. One gram of grain provides at least 5 unitsof
vitamins and 10 calories. If a gram of sovbean meal costs 7 cents, a gram of meat costs 9 cents, and a
gram of grain costs 1lcents. what misture of these three ingredients will provide at least 60 units of
vitamins and 66 calories per serving at a minimum cost? What will be the minimum cost?
27. A company manufactures and sells three models of large-sized pressure cookers for canteen use. While
market demands p0se no constraint. aluminium supplies are limited to 750 kgs per week and machine
time availability is limited to 600 hours per week. The resorce usage of the three models and their
profitability is given below:
Model
M1 M2 M3
Aluminium /unit 6 5
Machine-time lunit 4 5
Contribution T/unit 60 20 80
Formulate the problem as an LPP and solve for the optimal solution.
Revision Problems
211. Solve the following transportation problem for maximum profit. Use VAM and MODI methods.
It is given that currently, nothing can be sent from O3 to D2.
Markets
Warehouses Per unit profit () Supply
D1 D D3
50 17 70 10
60 40 60 45
O3 30 20 50 15
Demand 55 20 25
8
Operations Research Aida asn
processing and packing. with the
A01. Acompany haa three operational departmenta; weaving.
yielding a profit
capacity to prodluce two different types of clothes, namely suiting and wonllens,
hours in
of{A and 3 per meter, regpectively. One-meter suiting requireg 3 hours in weaving. 2
processing and Thour in packaging. while one meter of wnnllens requires 3 hours in each
lepartment. In a week, the total run time of each department 19 60. 90 and 5 hours for the
weaving, processing and packing departmenta, respectively.
(a) Formulate it as LPP.
(b) Use the graphical method to solve the problem graphically for the nptimal product mix.
(c) Identify the redundant constraint. Justify your answer.
403. A firm makes two products,Xand Y, and has a total production capacity of 9 tonnes per day. Xand r
requiring the same production capacity. The firm has a permanent contract to supply at least 2 tonnes
20 machine
of X and at least 3 tonnes of Y per day to another companv. Each tonne of Xrequires
hours of production time and each tonne of Yrequires 50 mach1ne hours of production time. The daily
be sold. and the proit
maximum possible number of machine hours is 360. All the firm's output can
made is R80 per tonne of X and 120 per tonne of Ý. You are required to.
(a) Formulate the LPP.
(b) Use Graphical Method to determine the production schedule for maximum proit and calculate
the profit.
Verify this answer by the ISO
(c) Will yor answer change if the profit per tonne of X is also 120?
Profit line method.