Scribd
Upload
11 views9 pages

Simplex

The document presents information on solving linear programming problems using the simplex method, including converting inequalities to equations using slack variables, setting up the initial simplex tableau, and using pivot rows and columns to iteratively solve the problem until an optimal solution is found. An example problem is provided about allocating time across two departments to maximize profit from producing two products. The simplex method is described as an algebraic approach to solve linear programs with more variables and constraints compared to the graphical method.

Uploaded by

Himanshu Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views9 pages

Simplex

The document presents information on solving linear programming problems using the simplex method, including converting inequalities to equations using slack variables, setting up the initial simplex tableau, and using pivot rows and columns to iteratively solve the problem until an optimal solution is found. An example problem is provided about allocating time across two departments to maximize profit from producing two products. The simplex method is described as an algebraic approach to solve linear programs with more variables and constraints compared to the graphical method.

Uploaded by

Himanshu Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Starex University

Presentation
on
Simplex Method
Sunmitted to : Submitted by:
Dr. Praneeta Himanshu Yadav
(Asstt. Professor) 2220505008
M.Sc. Mathematics 3 rd Sem
Simplex Method
The geometric method of solving linear programming
problemspresented before. The graphical method is use
ful only forproblems involving two decision variables
and relatively fewproblemconstraints.
What happens when we need more decision variable
s and more problemconstraints?
 We use an algebraic method called the simplex method
, which was developed by George B. DANTZIG (1914-
2005) in 1947 whileon assignmentwith the U.S.
Departmentof theair force.
Standard Form

 A linear programming problem is said to be a standar


d maximizationproblem in standard form if its
mathematical model is of the followingform:
Maximize the objective function:
Zmax = P= c1x1 + c2x2 + ……. + cnxn
Subject to problem constraints of the form
a1x1 + a2x2 + ….+ anxn <= b , b>= 0

With non- negative constraints


x1,x2,x3 ……….. >= 0
Solving problem using Simplex method
 Following steps are:
1-Converteachinequalityinthesetofconstraintstoanequationbyaddingslackvariables.2-
Createtheinitialsimplextableau.3-Selectthepivotcolumn.(Thecolumnwiththe
“
mostnegativevalueelement
”
inthelastobjectivefunctionrow.)4-Selectthepivotrow.(Therowwiththesmallestnon-
negativeresultwhenthelastelementintherowisdividedbythecorrespondingelementinthepiv
otcolumn.)5-
Useelementaryrowoperationstocalculatenewvaluesforthepivotrowsothatthepivotis1(Divid
eeverynumberintherowbythepivotnumber.)6-
Useelementaryrowoperationstomakeallnumbersinthepivotcolumnequalto0exceptforthepi
votnumber.Ifallentriesintheobjectivefunctionrowarezeroorpositive,thisthefinaltableau.Ifn
ot,gobacktostep3.7-
Ifyouobtainafinaltableau,thenthelinearprogrammingproblemhasanoptimalsolution,which
isgivenbytheentryinthelower-rightcornerofthetableau.
Pivot
Pivot Column:The column of the
tableaurepresenting the variable to be entered
intothe solution mix.Pivot
Row:The row of the tableau representingthe
variable to be replaced in the solution mix.Pivot
Number( element):The element in boththe pivot
column and the pivot row.
Slack Variables
1.“A mathematical representation of surplusresources.”
In real life problems, it’s unlikely
that all resources will be used completely, sothere
usually areunused resources.2.Slack
variablesrepresent the unused resourcesbetween
the left-hand side and right-handside of each
inequality.
Let's understand using an example
ApetroleumengineeringCompanyproducesthepro
ductsAandB.Eachunitof Atakesfourhoursindepart
mentLandtwohoursindepartmentM.Eachunitof B
requiresthreehoursindepartmentLandonehourin
departmentM.Duringthecurrentweek,240hoursof
timeareavailableinLand100hoursoftimeareavaila
bleinM.Eachunitof Aproducedgivesaprofitof $70a
ndeachunitof Bproducedgivesaprofitof $50.Howm
anyunitsofAandBshouldbemade?
Objective Function: Maximize
Time in departmentLConstraint
Time in departmentMConstraintNon-negativity
conditions
All information about the example
Department A(x1) B (x2) Availabble time
L 4 3 240
M 2 1 100
Unit Profit $70 $50

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy