0 Up votes0 Down votes

80 views2 pagesOperation research Big M Method procedure

Sep 03, 2013

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Operation research Big M Method procedure

Attribution Non-Commercial (BY-NC)

80 views

Operation research Big M Method procedure

Attribution Non-Commercial (BY-NC)

- The Woman Who Smashed Codes: A True Story of Love, Spies, and the Unlikely Heroine who Outwitted America's Enemies
- Steve Jobs
- NIV, Holy Bible, eBook
- NIV, Holy Bible, eBook, Red Letter Edition
- Hidden Figures Young Readers' Edition
- Cryptonomicon
- Console Wars: Sega, Nintendo, and the Battle that Defined a Generation
- Make Your Mind Up: My Guide to Finding Your Own Style, Life, and Motavation!
- The Golden Notebook: A Novel
- Alibaba: The House That Jack Ma Built
- Hit Refresh: The Quest to Rediscover Microsoft's Soul and Imagine a Better Future for Everyone
- Hit Refresh: The Quest to Rediscover Microsoft's Soul and Imagine a Better Future for Everyone
- Autonomous: A Novel
- The 10X Rule: The Only Difference Between Success and Failure
- Everybody Lies: Big Data, New Data, and What the Internet Can Tell Us About Who We Really Are
- Life After Google: The Fall of Big Data and the Rise of the Blockchain Economy

You are on page 1of 2

variables, to generate the initial basic feasible. But the methods like Big-M method and Two-Phase methods are adopted basing on the objectivity to drive out the Artificial Variables out, while obtaining the objective function value. The Big-M method handles the panelized artificial variables assigning either very small (i.e. maximization problem are assigned with -M) or very large (i.e. minimization problem are assigned with +M) coefficients to the artificial variables, to reduce their influence on the objective function optimal value and the coefficient M is treated to be of very large in value (i.e. M>>>>0). This method also is termed as Charne`s Penalty Method, as it utilizes a large or small penalty M. It tries to get driven of the Artificial Variables, as soon as they leave the basis by deleting/eliminating their computation in the next iteration. Step 1: Formulation of LPP i.e. Maximize / Minimize Z = c1x1 + c2 x2 + .......... + cn xn

a11 x1 + a12 x2 + ..... + a1n xn ( or = ) b1 a21 x1 + a22 x2 + ..... + a2n xn ( or = ) b2 . Subjected to . . am1x1 + am 2 x2 + ..... + amn x n ( or = ) bm x1, x2 ,...xn 0 or un restricted and bm 0

j =1

Subjected to

a x ( or = ) b , i = 1,2......m

ij j i j =1

and x j 0 and bi 0

Where c j is termed Cost Coefficients, bi is termed as Resources/Solution Values of Basic variables, aij is termed as Technological/Input-Output coefficients, n is number of variables, m is number of constraint equations. Step 2: Verifying the suitability of applying Simplex method or Artificial Variable Technique (like Big-M method or Two-Phase Method) Check whether the RHS (i.e. all bi ) of constraint equations are positive or not. If not, change their sign by multiplying throughout by -1 and thereafter check whether all the inequality symbols in the constraint equations are greater than or equal to ( or = ) or not. If not adopt Simplex method. Step 3: Subtracting Slack variables and adding Artificial Variables Subtract slack variables and add artificial variables to convert all inequalities constraint equations to equality equations. I.e. the constraint equation having Greater than inequality ( ) should be subtracted with slack variable ( Si or in other words also termed as Surplus Variable), which represent over fulfillment of requirement and at the same time add an imaginary penalty artificial variable ( ( Ai ) , to the L.H.S thereby the equal (=) type constraint generates between LHS and RHS of the constraint equation. E.g: if constrain equation is a11 x1 + a12 x2 + ... + a1n xn b1 , then convert it as a11 x1 + a12 x2 + ... + a1n xn S1 + A1 = b1 and add the surplus with 0 coefficients and -M or +M coefficients for Artificial variables respectively, in the objective function. E.g: Maximize Z = c1x1 + c2 x2 + .... + cn xn + 0 * S1 + 0 * S2 + .... + 0 * Sm M * A1 M * A2 ...... M * Am or

Maximize Z = c1x1 + c2 x2 + .... + cn xn + 0 * S1 + 0 * S2 + .... + 0 * Sm + M * A1 + M * A2 + ...... + M * Am

If the constrain equation has only equal to (=) symbol between LHS and RHS of the equation, then add only Artificial Variable. E.g.: if constrain equation is a11 x1 + a12 x2 + ... + a1n xn = b1 , then convert it as a11 x1 + a12 x2 + ... + a1n xn + A1 = b1 and add the surplus with 0 coefficients and -M or +M coefficients for Artificial variables respectively, in the objective function. E.g: Maximize Z = c1x1 + c2 x2 + .... + cn xn + 0 * S1 + 0 * S2 + .... + 0 * Sm M * A1 M * A2 ...... M * Am or

Maximize Z = c1x1 + c2 x2 + .... + cn xn + 0 * S1 + 0 * S2 + .... + 0 * Sm + M * A1 + M * A2 + ...... + M * Am

Hence, the modified objective function and constraint equations will be written as;

Maximize / Minimize Z = c1x1 + c2 x2 + .... + 0 * S1 + 0 * S2 + .... + 0 * Sm M * A1 M * A2 ..... M * Am

a11x1 + a12 x2 + ... + a1n xn S1 + A1 = b1 a21x1 + a22 x2 + ... + a2 n xn S2 + A2 = b2 . Subjected to . . am1x1 + am 2 x2 + ... + amn xn Sm + Am = bm x1, x2 ,...xn , S1, S2 ,....,Sm 0 and bm 0

j =1 i =1 i =1

Subjected to

(a x ) S

ij j j =1

Step 4: Apply the procedure of Simplex method by giving preference to artificial variables as Initial Basic variables, so that they can be drive out in later iterations. Note: 1. In a constraint equation, if a surplus and Artificial Variables are present then the artificial variable need to be taken into the basis. 2. The iterations should be done, to drive out the artificial variables. Once they (i.e. Artificial Variables) are driven out, eliminate its computation in the successive iterations. Step 5: Carry out the Simplex algorithm till optimality is reached. The optimal table generates solution to the objective function, while the artificial variables may or may not be driven out. In this regard, there arise three cases in the optimal table, mentioned below. Case 1: If no artificial variables remains as basic variables (i.e. in basis) in the optimality tableau, then the original problem is feasible and has unique optimal solution in the optimal table. Case 2: If any of the artificial variables remains as basic variables (i.e. in basis) in the optimality tableau, with zero value, then the original problem has to be solved for optimal solution. Case 3: If any artificial variables are positive in value in the optimal solution (i.e. in optimality Tableau), then the original problem has infeasible solution.

- Compressor Station Optimization Using Simulation-Based OptimizationUploaded byAmbrish Singh
- Linear and NonLinearProgramming18903341XUploaded bysomeone4248
- Sequential Modular and Simultaneous Modular StrategiesUploaded bykim haksong
- MSCI603-F2018-03_SimplexUploaded byMridul Gupta
- Operation_ResearchUploaded bySekla Shaqdiesel
- SoftwareDevelopmentofOptimalSubstationGroundGridDesignBasedonGeneticAlgorithmandPatternSearchUploaded bybal krishna dubey
- Simplex Method StepsUploaded byShivram Dhillon
- OPERATIONS RESEARCH 01Uploaded byRobin Smith
- A STUDY ON OPTIMIZATION OF SHIP HULL FORM BASED ON NEURO-RESPONSE SURFACE METHOD (NRSM)Uploaded byGoutam Kumar Saha
- Meljun Cortes Algorithm Iterative Improvement IIUploaded byMELJUN CORTES, MBA,MPA
- 37526712 Chapter 3 Linear ProgrammingUploaded bySaad Shaikh
- Wcdmaoptimizationdrivetestanalysis 141105231618 Conversion Gate02Uploaded byEduardo Javier
- 1-s2.0-S0022460X85703914-mainUploaded byMandar Chikate
- Script MotorDesignUploaded byKusum0
- wcdmaoptimizationdrivetestanalysis-141105231618-conversion-gate02.pdfUploaded byVolodymyr Borushok
- Chapter 6Uploaded byBeverly Paman
- An Improved Particle Swarm Optimization for Proficient Solving of Unit Commitment ProblemUploaded byIDES
- opt problemsUploaded byPanos
- Froth DepthUploaded byPradityo Nur Oktoviarto
- Bahan OM Mg07-AggregatUploaded byWisena Perceka
- Numerical Solution to Identification Problems of Material ParametersUploaded byMaria Paula Pineda Martínez
- PPT WDSUploaded byPALLAVI NIMBALKAR
- SurajShenoy ISP Thesis ProposalUploaded bySuraj Shenoy Nagar
- Comprehensive Exam Comp CoursesUploaded byosita onyejekwe
- 01033734Uploaded byIsai Santana
- Multi-fase di ottimizzazione dei costi di produzione dei telai in acciaio semi-rigidi con algoritmi genetici.pdfUploaded byStefania Villacidro
- dipiUploaded byPraveen Yadav
- Design_Optimization_of_Laminat.pdfUploaded byNoman
- Use of Panel Code Modelling in a Framework for Aircraft Concept OptimizationUploaded byAhmad Sofwan Shahabudin
- Studies in Chemical Process Design and Synthesis_PartIII_A Simple and Practical Approach to the Optimal Synthesis of HE NetworksUploaded byMarco Ravelo

- Two Phase Procedure -- Operation ResearchUploaded byRavi Kumar
- Java Server PagesUploaded byRavi Kumar
- Transport LayerUploaded byBandi Ravali
- Simplex Procedure -- Operation ResearchUploaded byRavi Kumar
- Aptitude Logical Reasoning1Uploaded byRavi Kumar
- input-output interface, modes of transfer, direct memory access, input output processor, serial .pdfUploaded byRavi Kumar

- PSSMUploaded byrayx_1
- Descargas 1roUploaded byjaime
- MCA_I_MO14_MESRA.pdfUploaded byAshwani Singh Chauhan
- AssigmentUploaded byHashan Darshana
- MCQ-1_PSAUploaded byAshok Hirpara
- Lec17PattRec09.pdfUploaded byAmandeep Sharma
- MTH603 Final Term Solved MCQsUploaded byMuhammad Asif Butt Mohsini
- Solution Tutorial Week 4Uploaded byLuis Guillermo Perez Verbel
- CellRE.etcUploaded bytheloneboatman
- SIMULATED ANNEALING.pptUploaded byAditiLavigne
- ANN MatlabUploaded byAkhil Arora
- 2-%20Interpolation.pdfUploaded byArushi Rawat
- 620362_ColGenUploaded byAhmed Abz
- AlgebraUploaded byakansal
- Numerical Analysis 2210Uploaded bynidhyn
- Iterative MethodsUploaded byRao Visweswara Mohan
- Perceptron Learning Rule2.pdfUploaded byMohammed Imran
- Linear and Nonlinear Programming With Maple an Interactive, Applications-based ApproachUploaded byMohammad Abdelaal
- CISE301-Topic8L2Uploaded bysamadazad
- cnd_013_08_081006.pdfUploaded byFawaz Parto
- _lec_2_-_neural_network_perceptron_adaline_.pdfUploaded byLoris Franchi
- Numerical AnalysisUploaded byRadj90
- Recurrent Neural NetworksUploaded byStefan Postavaru
- Computational PhysicsUploaded byMohsen Khosravi
- Course Outline - MSMEUploaded byAbdullah Ilyas
- ApproxSolutionsUploaded byGopal Kondagunta
- Cheatsheet Deep LearningUploaded byMichelleHan
- NFA to DFAUploaded byNisha Vasudev R
- Portfolio_AnirudhUploaded byAnirudh Rajagopal
- Lecture Notes Interpolation and Data FittingUploaded byAmbreen Khan

## Much more than documents.

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

Cancel anytime.