0 Up votes0 Down votes

0 views24 pagesMay 17, 2019

M3L4.ppt

© © All Rights Reserved

PPT, PDF, TXT or read online from Scribd

© All Rights Reserved

0 views

M3L4.ppt

© All Rights Reserved

- Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race
- Hidden Figures Young Readers' Edition
- The Law of Explosive Growth: Lesson 20 from The 21 Irrefutable Laws of Leadership
- The E-Myth Revisited: Why Most Small Businesses Don't Work and
- The Wright Brothers
- The Power of Discipline: 7 Ways it Can Change Your Life
- The Other Einstein: A Novel
- The Kiss Quotient: A Novel
- State of Fear
- State of Fear
- The 10X Rule: The Only Difference Between Success and Failure
- Being Wrong: Adventures in the Margin of Error
- Algorithms to Live By: The Computer Science of Human Decisions
- The Black Swan
- Prince Caspian
- The Art of Thinking Clearly
- A Mind for Numbers: How to Excel at Math and Science Even If You Flunked Algebra
- The Last Battle
- The 6th Extinction
- HBR's 10 Must Reads on Strategy (including featured article "What Is Strategy?" by Michael E. Porter)

You are on page 1of 24

Simplex method - II

Objectives

Objectives

To discuss the Big-M method

Discussion on different types of LPP

solutions in the context of Simplex method

Discussion on maximization verses

minimization problems

Big-M Method

equal-to’ ( ) and ‘equality’ (=) constraints

needs a modified approach. This is known as

Big-M method.

incorporating a large coefficient M

Transformation of LPP for Big-M

method

equal-to’ (≥) and equality (=) constraints to ensure an initial

basic feasible solution.

2. Artificial variables are ‘penalized’ in the objective function by

introducing a large negative (positive) coefficient for

maximization (minimization) problem.

3. Cost coefficients, which are supposed to be placed in the Z-

row in the initial simplex tableau, are transformed by ‘pivotal

operation’ considering the column of artificial variable as

‘pivotal column’ and the row of the artificial variable as ‘pivotal

row’.

4. If there are more than one artificial variables, step 3 is

repeated for all the artificial variables one by one.

Example

Maximize Z 3 x1 5 x2

subject to x1 x2 2

x2 6

3 x1 2 x2 18

x1 , x2 0

Example

Maximize Z 3x1 5 x2 Ma1 Ma2

subject to x1 x2 x3 a1 2

x2 x4 6

3x1 2 x2 a2 18

x1 , x2 0

where x3 is surplus variable, x4 is slack variable and a1

and a2 are the artificial variables

Transformation of cost coefficients

x1 x2 x3 a1 2 E2 Pivotal Row

Pivotal Column

By the pivotal operation E1 M E2 the cost coefficients are modified as

Z 3 M x1 5 M x2 Mx3 0 a1 Ma 2 2M

Transformation of cost coefficients

constraint

Z 3 M x1 5 M x2 Mx3 0 a1 Ma2 2M E3

3 x1 2 x2 a2 18 E4

Pivotal Row Pivotal Column

Construction of Simplex

Tableau

Pivotal row, pivotal column and pivotal elements are shown as earlier

9 D Nagesh Kumar, IISc Optimization Methods: M3L4

Simplex Tableau…contd.

Simplex Tableau…contd.

Simplex Tableau…contd.

Simplex method: ‘Unbounded’,

‘Multiple’ and ‘Infeasible’ solutions

Unbounded solution

If at any iteration no departing variable can be found

corresponding to entering variable, the value of the

objective function can be increased indefinitely, i.e.,

the solution is unbounded.

Simplex method: ‘Unbounded’,

‘Multiple’ and ‘Infeasible’ solutions

has a coefficient 0 in the Z-row, it indicates that an

alternative solution exists.

This non-basic variable can be incorporated in the

basis to obtain another optimal solution.

Once two such optimal solutions are obtained,

infinite number of optimal solutions can be obtained

by taking a weighted sum of the two optimal

solutions.

14 D Nagesh Kumar, IISc Optimization Methods: M3L4

Simplex method: Example of

Multiple (indefinite) solutions

Maximize Z 3 x1 2 x2

subject to x1 x2 2

x2 6

3 x1 2 x2 18

x1 , x2 0

Only modification, compared to earlier problem, is that the

coefficient of x2 is changed from 5 to 2 in the objective function.

Thus the slope of the objective function and that of third

constraint are now same, which leads to multiple solutions

15 D Nagesh Kumar, IISc Optimization Methods: M3L4

Simplex method: Example of

Multiple (indefinite) solutions

tableau for the problem is as follows:

Simplex method: Example of

Multiple (indefinite) solutions

is reached.

br

Based on the , x4 will be the exiting variable

crs

Simplex method: Example of

Multiple (indefinite) solutions

If one more similar step is performed, previous simplex tableau will be obtained back

18 D Nagesh Kumar, IISc Optimization Methods: M3L4

Simplex method: Example of

Multiple (indefinite) solutions

6 2

Thus, two sets of solutions are: and

0 6

6 2

Other optimal solutions will be obtained as b 1 b

0 6

where b 0,1

3.6

For example, let b = 0.4, corresponding solution is

3.6

changed for different sets of solution; for all the

cases Z = 18.

Simplex method: ‘Unbounded’,

‘Multiple’ and ‘Infeasible’ solutions

Infeasible solution

variables still exists in the basis, the solution is

indefinite.

Minimization versus

maximization problems

standard form of LP problems, i.e., objective

function is of maximization type

However, if the objective function is of

minimization type, simplex method may still

be applied with a small modification

Minimization versus

maximization problems

following two ways.

1. The objective function is multiplied by -1 so as to keep the

problem identical and ‘minimization’ problem becomes

‘maximization’. This is because minimizing a function is

equivalent to the maximization of its negative

2. While selecting the entering nonbasic variable, the variable

having the maximum coefficient among all the cost

coefficients is to be entered. In such cases, optimal

solution would be determined from the tableau having all

the cost coefficients as non-positive ( 0)

Minimization versus

maximization problems

problem, is that it consists of the constraints with

‘greater-than-equal-to’ () sign. For example,

minimize the price (to compete in the market),

however, the profit should cross a minimum

threshold. Whenever the goal is to minimize some

objective, lower bounded requirements play the

leading role. Constraints with ‘greater-than-equal-to’

( ) sign are obvious in practical situations.

To deal with the constraints with ‘greater-than-

equal-to’ () and equality sign, Big-M method is to

be followed as explained earlier.

Thank You

- Dual Simplex AlgorithmUploaded byrockgauss
- Sample MidtermUploaded byaskar_cba
- LINEAR PROGRAMMING_GRAPHICAL METHOD.pptUploaded byJouhara San Juan
- Explanation of Simplex MethodUploaded byJeth Vigilla Nangca
- Simplex MethodUploaded byRitika Singh
- {i9F-ah2-Jdi}Intro (1)Uploaded byMartha Nita Florentina
- report1Multi-ObjectiveOptimizationUploaded byVladimir Garcia Quintana
- MSCI603-F2018-03_SimplexUploaded byMridul Gupta
- 011012_1Uploaded byBita Mohajernia
- Tutorial-7.pdfUploaded byAnimesh Choudhary
- Resume nUploaded byFernando Villordo
- M3L6_LNUploaded byswapna44
- CIRRELT-2016-30Uploaded byMichel Rodrigo
- Simplex 3Uploaded byMukesh Bohra
- 94365_Two.Phase.Simplex.pdfUploaded byreza
- 6-11Uploaded byKrishnaPavan
- Excel Solver-An Optimization ToolUploaded bymohsindalvi87
- 06 Bust Proceedings optimizationUploaded byKarthik Karunanidhi
- 2007-LNCSUploaded bynarendra
- .. TenthClass Content EM Mathematics 04 LinearProgrammingUploaded byRaja Ramachandran
- Edoc.site Mcq Operation ResearchUploaded byBraja kumbhar
- THE_MATCHINGUploaded byBaraa Sbaih
- 1504602936Module19Quadrant-IUploaded byshreekantb
- Paper 3Uploaded byMiguel Acb
- MATH 103 FA 2015 Syllabus-RalstonUploaded byDanny L Ralston
- J.pdfUploaded bysiti nur aini
- An Oil Pipeline Design ProblemUploaded bycatatal123
- A MODIFIED NEWTON'S METHOD FOR SOLVING NONLINEAR PROGRAMING PROBLEMSUploaded byjhon jairo portilla
- Location Capacity Demand Allocation Telecom OpticUploaded byChristine Chao
- 2. Transportation ModelUploaded byLelouch V. Britania

- Selecting Screen Size and Open Area.pdfUploaded bytadela_553439598
- Tutorial Gearbox 2012 EnUploaded byAnkush B. Amale
- 7ML19985FB06.1Uploaded bychandraprakashhh
- PBD01Uploaded byRetno Aulia Vinarti
- Improving Online Admission SystemUploaded byKumar2019
- 8.2 Force Method Using an External Reaction Redundant Force _ Learnaboutstructures.comUploaded byReginaYacika
- Iinet Manual - Low ResUploaded byBen Low
- HYDROGEN POWERED CAR CONTROL SYSTEM of Technical University of OstravaUploaded byumtkyck
- Visual Basic HandbookUploaded byroshan_shenoi
- Extra Reading Unit 7. Robot BabyUploaded byIba Laçi
- Handout 27Uploaded bySerap Inceçayır
- Blood, AnalogyUploaded byvmktpt
- BADI PPUploaded bySatheesh kumar
- Water Jug & MissionariesUploaded byAdmire Chaniwa
- Copywriting for Social Media by SocialBeeUploaded byAndrew Richard Thompson
- Azure Developer Guide eBook en-GBUploaded byMuhammad Danish Khan
- Embedded Systems Interview Questions - Embedded Systems FAQUploaded bynarendra
- Analysis of Blue chip Swiss market indexUploaded byIlaria Marchese
- A survey on sentence fusion techniques of abstractive text summarizationUploaded byAnonymous 7VPPkWS8O
- CS6303 - Database Management Systems (DBMS)SasuriUploaded byJohn Downey Jr.
- Joystick Controller 26SE EnUploaded byAnonymous yCFSresrfT
- Chap 01 RN FinancialsUploaded byOnur Onuk
- Microsoft Cabarc User's Guide.rtfUploaded byZhao Xiaogang
- AlgoSec Firewall Analyzer DatasheetUploaded byGaston Acevedo
- Ebiz 12.2 SecurityUploaded bysundeep_dubey
- Blanchard P., Volchenkov D. - Random Walks and Diffusions on Graphs and Databases. an Introduction - (Springer Series in Synergetics) - 2011Uploaded byfictitious30
- IoE-AAGUploaded byrajekri
- Tiered Pricing EbscoUploaded byGeorge Williams
- Diagnostic Picture Tests in Pediatrics, 2nd Edition, 1990Uploaded byMobin Ur Rehman Khan
- ITUploaded bydodosasa

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.