0 Up votes0 Down votes

14 views44 pagesoperations Research

Apr 18, 2013

© Attribution Non-Commercial (BY-NC)

PPSX, PDF, TXT or read online from Scribd

operations Research

Attribution Non-Commercial (BY-NC)

14 views

operations Research

Attribution Non-Commercial (BY-NC)

- Steve Jobs
- Wheel of Time
- NIV, Holy Bible, eBook
- NIV, Holy Bible, eBook, Red Letter Edition
- Cryptonomicon
- The Woman Who Smashed Codes: A True Story of Love, Spies, and the Unlikely Heroine who Outwitted America's Enemies
- Contagious: Why Things Catch On
- Crossing the Chasm: Marketing and Selling Technology Project
- Everybody Lies: Big Data, New Data, and What the Internet Can Tell Us About Who We Really Are
- Zero to One: Notes on Start-ups, or How to Build the Future
- Console Wars: Sega, Nintendo, and the Battle that Defined a Generation
- Dust: Scarpetta (Book 21)
- Hit Refresh: The Quest to Rediscover Microsoft's Soul and Imagine a Better Future for Everyone
- The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution
- Crushing It!: How Great Entrepreneurs Build Their Business and Influence—and How You Can, Too
- Make Time: How to Focus on What Matters Every Day
- Algorithms to Live By: The Computer Science of Human Decisions
- Wild Cards

You are on page 1of 44

T.T. Narendran

Department of Management Studies Indian Institute of Technology Madras

A furniture shop manufactures tables and

chairs.

The

operations

take

place

required by each product at each work center

52

TTN DoMS, IIT Madras, 17-Apr-13 53

Furniture Shop

Tables

Chairs

8 4 2

6 2 4 60 48

Formulate a linear programme to determine the optimal number of tables and chairs to be

52

TTN DoMS, IIT Madras, 17-Apr-13 53

The following linear programme is formulated

This problem can be solved graphically. The following figure shows the constraints ;

50

TTN DoMS, IIT Madras, 17-Apr-13 51

X2

50

solve this problem, a few concepts are

introduced.

Convex Set:

If there exists a set in which a straight line joining any two points in the set is also contained in the set, then such a set is called a convex set

at a corner point. This property is used for

programme.

The expression

A series of parallel lines for various assumed values of Z can be drawn. These are called Isoprofit lines. The profit Z along each line is the same.

The value of Z is seen to increase as the isoprofit lines move farther away from the origin. The corner point through which the last isoprofit line passes, gives the optimal solution.

TTN DoMS, IIT Madras, 17-Apr-13

10

X2

TTN DoMS, IIT Madras, 17-Apr-13

C(15,0)

11

Z0 = 0 ZA = 72

ZB = 132

ZC = 120

occurs at corner point B (12,6) i.e., X1 = 12, X2 = 6 with the corresponding profit of 132 which is the maximum.

TTN DoMS, IIT Madras, 17-Apr-13

12

solve problems with just two variables. The need, however, is for a method that can solve problems of realistic size. For this purpose, there exists a method called the Simplex Algorithm developed by George.B. Dantzig.

13

Basic Solution: Consider the following set of equations :

14

There are four variables and two equations. Hence this cannot be solved as simultaneous equations. However, it is possible to find a set of solutions called basic solutions which are obtained as follows

variables = 0, we can solve for the remaining variables.

15

For instance, if we set We get This is called a basic solution. We can see that there are as many as solutions. . Of these, the solutions that also satisfy the non-negativity condition are called basic feasible solutions

16

equations with n variables (where n > m),

(n - m) variables = 0 and solving for the remaining variables.

There will be

basic solutions

17

Canonical form :

If there exists a system of equations such that each equation has one variable with coefficient of 1 in that equation and a coefficient of 0 in all the other equations, such a system is said to be in Canonical form. The given system is seen to be in Canonical

form since

18

Other Definitions :

The variables that are set = 0 are called non basic variables while the remaining variables are called basic variables. Now let us consider the same example:

19

Remove the inequalities and rewrite the constraints as equations by introducing 'slack variables' are shown below

This is a system of two equations with four variables. Choose the variables in canonical form, i.e., as the basic variables for the initial solution. Rewrite the equations, expressing the basic variables in terms of non-basic variables.

TTN DoMS, IIT Madras, 17-Apr-13

20

Both the non basic variables have positive coefficients in the objective function and hence have the potential to increase the value of Z .

21

Let us now consider making X1 a basic variable. To do this, one of the existing basic variables must

variables at any stage. To find out which variable is to be replaced, we find the maximum possible value for X1 in equations (1) and (2).

22

23

Of these, only the lower value will satisfy both the constraints. Hence

24

25

When we examine for the maximum possible value of X2 in (3) and (4), we see that X3 displaces X4 as basic variable.

26

Here, the coefficients of both the nonbasic variables in the objective function are negative. Hence, there is no further scope for increasing the value of Z. So the final solution is

27

T.T. Narendran

Department of Management Studies Indian Institute of Technology Madras

28

The algorithm explained above can be

implemented in a tabular form for greater working convenience. This form is also easier for coding and automation purposes. The key features of the tabular form are as follows:

TTN DoMS, IIT Madras, 17-Apr-13

29

The corresponding coefficients appear in the boxes of the table. CB = Coefficient of Basic Variable in the objective function

It can be seen that the tabular form is just another way of representing the same set of equations used above

30

31

X3 = 60, X4 = 48, Z = 0

32

In the row Cj Zj , the positive coefficients for the non basic variables X1 and X2 indicate that the value of Z will increase if one of these variables becomes a basic variable.

We choose X1to become the basic variable.

This requires one of the existing basic variables to become non basic.

In other words, X1is the entering variable. We have to find the departing variable.

TTN DoMS, IIT Madras, 17-Apr-13

33

Now, evaluate the ratio bi / aij for all aij >0 in this column.

The ratios are

60 / 4 = 15 and 48 / 2 = 24

The minimum ratio determines the departing variable. Hence, in this case X3 is the departing variable. The coefficient 4 corresponding operation is called the pivot. to this

34

The next table is obtained by performing the following operations. In the 'basis' column X1 replaces X3.

Divide the pivotal row (4 2 1 0 | 60) by the pivot (4). 15) We get (1 0 |

35

To get the X4 row, do the following : Multiply the new row just obtained by the coefficient in the pivotal column (2). We get (2 1 0 | 30) Subtract corresponding elements from the old X4 row. That is

36

This constitutes the new X4 row in the table. The Cj Zj row is evaluated as follows :

Zj = CB aij

For example,

Z2 = 8 () + 0 (3) = 4 and

C2-Z2 = 6-4 = 2

TTN DoMS, IIT Madras, 17-Apr-13

37

38

reads as X1 = 15, X4 = 18, Z = 120, Since the X2 column in the Cj Zj row shows a positive value, we now bring in X2 as the entering variable. Proceeding as before, we find 18 / 6 = 3 is less than 15 / () = 30

TTN DoMS, IIT Madras, 17-Apr-13

39

The next table is obtained using the same steps described earlier

40

41

The coefficients of the non basic variables in the Cj Zj row are all non positive. Therefore, there is no further scope for increasing the value of Z.

Hence the algorithm stops at this stage. The given solution is the optimal solution

TTN DoMS, IIT Madras, 17-Apr-13

42

are given below :

Rewrite inequalities as equations using slack variables. Set up L.P in tabular form. Determine the entering variable as one with a positive Cj Zj coefficient ; Generally, the variable with the maximum Cj Zj is chosen as the entering variable though this is not a strict criterion.

TTN DoMS, IIT Madras, 17-Apr-13

43

Determine the departing variable as the row in which the aij coefficient yields the minimum positive bi / aij (aij >0). The aij corresponding to the departing variable is called the pivot. In order to obtain the next table, perform the following steps.

Divide the pivotal row throughout by the pivot.

TTN DoMS, IIT Madras, 17-Apr-13

44

Multiply this new row by coefficients in the pivotal column and subtract the product from the corresponding old row;

Repeat this process till the table is complete. Check if there is any Cj Zj > 0. If so, repeat steps (3) - (7). If not, read off the optimal solution from the last table.

- 3.5-5.docxUploaded byMariella Singson
- Exercises SolutionsUploaded byMohamed Mansour
- napkin problemUploaded byDian Septiana
- Simplex MethodUploaded byNoor Shafiqaryana Mohammad
- 174190_Lec05_06.pdfUploaded byalb3rtnet
- QMT337 (1)Uploaded byMohamad Najib
- ch19Uploaded byradislamy
- mathUploaded byተመስገን ጎዴ
- ormpexUploaded byDanielle Smith
- fwebtechnologyUploaded bysharmila
- Using the Simplex Method to Solve LinearUploaded byNazahra Risky Maghfira
- em8720.pdfUploaded byayush gupta
- Colin Drury chapter 26Uploaded byanggianggraini
- LPPUploaded byMonjit Dutta
- Operation Research Mb 301Uploaded bygrovergaurav13
- SimplexUploaded byheshambm
- A lecture on optimizationUploaded bySeshu Bollineni
- Chap006sUploaded byRana Gaballah
- Intro Class 1Uploaded bySahib Dhanjal
- Lecture 1Uploaded byMilagros Rios
- IATOM17_OR_CO_slideshow.pdfUploaded byJacob Liu
- ijsrp-p1751.pdfUploaded bynetgalaxy2010
- 21529sm Finalnew Vol2 Cp10Uploaded byBint e Yameen
- 04.2 Chapter4_Duality.pdfUploaded byAshoka Vanjare
- Finals 2016 SolutionsUploaded bySaumo Pal
- Tutorial 1Uploaded byBoon Charisma Leo
- LPP TheoryUploaded byVIKASH
- Mixed integer optimization: a new step in formulation softwareUploaded byMilling and Grain magazine
- Guia Estaciones de PeajeUploaded byofmedina
- Computaional Economics - MotivationUploaded byisaac_maykovich

- Lecture-1 an Introduction to Indian PhilosophyUploaded bySravan Kumar Reddy
- Data Scientists Guide to Apache SparkUploaded byMahesh
- Data Structures Algorithms Multiple Choice Questions MCQsUploaded bysibanandarms
- Machine Learning Yarning - Andrew Ng -23 to 27Uploaded byJorge Leandro
- AptitudeUploaded byFAZULUL RAHMAN
- Retracted Without RiserUploaded bysibanandarms
- aqwa-waveUploaded bysibanandarms
- Sep11 2012 Striptheory HeaveUploaded bysibanandarms
- Sep 17 Striptheory PitchUploaded bysibanandarms
- Academic Calendar Jul-Dec 2013Uploaded byAwin Wasan
- Secondary Education in IndiaUploaded bysibanandarms
- 1 Dynamics+of+Structures 12.7Uploaded byHelber Garcia

- Lossless CompressionUploaded byAnonymous gUjimJK
- SimulationUploaded byPihu Jain
- We i Bull AnalysisUploaded byImron Mashuri
- i2ml2e-chap1-v1-0Uploaded bylazyboyz
- Numerical Methods Srk Iyenger Jain RotatedUploaded byMuhammad Shehbaz
- DAA Lab AnswersUploaded bytharindutpd
- PID1.xlsUploaded byrocao
- hw3ansUploaded bydelinne
- CS 507 - Lect-08 - GraphicsUploaded byJibran Ahmad
- Efficient Incremental Fuzzy Logic ControllerUploaded byVijaya Chintala
- 000511Uploaded bysalim
- Issues on Railway Wagon Asset Management Using Advanced Information SystemsUploaded byJoshua Bailey
- 09volpathUploaded byMike Gao
- Graphs — Problem Solving With Algorithms and Data StructuresUploaded byKanishk Aman
- applsci-08-00261Uploaded byAnonymous ok5Q4tbbo
- Call for papers 19th International Symposium on Communications and Information TechnologiesUploaded byJames
- Bruno Dupire Slide 1-2Uploaded byTze Shao
- lec21.pdfUploaded byVanitha Shah
- Chameleon ClusteringUploaded byTanooj Parekh
- 227142020 Finite Element Design of Concrete Structures 2nd Rombach 17Uploaded byRichard Bryan
- Eigenvalues and EigenvectorsUploaded bykvdorn
- Level Pool Routing ProcedureUploaded bypalaisdemari631
- curs 5,6 REGRESIA liniara, logistica.pdfUploaded bySergiu Stascu
- 73701 92002v01 Improving Simulation Performance in SimulinkUploaded byJoão Ferro
- Manferdelli_011006Uploaded byMatt Kirk
- Assignment Lcs - Assignment -01Uploaded byrizwan ahmed
- pp.163-175Uploaded byHANBALCONTRAMUNDUM
- bode_lectUploaded byishann123
- A LITERATURE SURVEY ON SECURE JOINT DATA HIDING AND COMPRESSION SCHEME TO STORE HIGH CAPACITY DATA IN IMAGEUploaded byInternational Jpurnal Of Technical Research And Applications
- the xtea cryprology algorithmUploaded bymiki_dudaul

## Much more than documents.

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

Cancel anytime.