© All Rights Reserved

3 views

© All Rights Reserved

- Intelligence & Synergy of Everyone
- or.pdf
- Evalutionary Algth
- MINLP
- olhaes de içamento
- note2-graphicalmethod
- 14, 42, 61 or1 lp.ppt
- Linear Programming
- 1-s2.0-0024630174900818-main
- or assign
- 206C-Computer Based Optimization Techniques.pdf
- operation research
- Chapter 5
- 15 marks QT
- 251C-Quantitative Methods for Management
- The Tactical Berth Allocation Problem With Quay Crane Assignment and Tran
- Manual de MPL
- D1,L9 Linear Programming.ppt
- Bi-level Linear Programming Problem with Neutrosophic Numbers
- 4th Semester, Applied Operations Research

You are on page 1of 4

Department of Mathematics

MAT581SS

Prepared by Jeff C.-F. WONG

Exercise 3 - September 21, 2009

Name in English:

Student No.:

Name in Chinese:

Step 1:

Convert the LPP into maximisation form.

Express it in the standard form by introducing slack and/or surplus variables as the case may be.

Step 2:

Introduce non-negative variables to the left-hand side of all the constraints of ( or =) type.

These variables are called artificial variables.

The purpose of introducing artificial variables is just to obtain an initial basic feasible solution.

In order to get rid of the artificial variables in the final optimum iteration, we assign a very large penalty

M to these artificial variables in the objective function for maximisation objective function.

Step 3:

Solve the modified linear programming problem by simplex method.

While making iterations by this method, one of the following three cases may arise.

(a) If no artificial variable remains in the basis and the optimality condition is satisfied, then the current

solution is an optimal basic feasible solution.

(b) If at least one artificial variable appears in the basis at zero level (with zero value in the XB column)

and the optimality condition is satisfied, then the current solution is an optimal basic feasible (though

degenerated) solution.

(c)

If at least one artificial variable appears in the basis at non-zero level (with positive value in XB

column) and the optimality condition is satisfied, then the original problem has no feasible solution.

The solution satisfies the constraints but does not optimise the objective function since it contains a

very large penalty M and is called pseudo optimal solution.

Step 4:

Application of simplex method is continued until either

an optimum basic feasible solution is obtained

or

there is an indication of the existence of an unbounded solution to the given LPP.

The solution can be obtained in two phases.

Phase I It consists of the following steps:

Step 1:

Convert the LPP into maximisation form and ensure that all bi (constant terms) are non-negative,

i.e., bi 0.

If some of them are negative, make them non-negative by multiplying both sides of those inequations/equations by 1.

Step 2: Add artificial variables Ai ( 0) to the LHS of the constraints of (= and ) to complete the identity

matrix In .

Step 3: Express the given LPP in standard form.

Step 4: Obtain an initial basic feasible solution.

Step 5:

Assign a cost 1 to each artificial variable and a cost 0 to all other variables (in place of their original

cost) in the objective function.

The new objective function is

max z = A1 A2 An ,

where Ai s are the artifical variables.

Step 6: Write down the auxiliary LPP in which the new objective function is to be maximised subject to the

given set of constraints.

Step 7: Solve the auxiliary LPP by simplex method until either of the following three possibilities arise:

(i) max z < 0 and at least one artificial variable appears in the optimum basis at a +ve level. In this

case no feasible solution exist, stop the procedure.

(ii) max z = 0 and at least one artificial variable appears in the optimum basis at zero level.

(iii) max z = 0 and no artificial variable appears in the optimum basis.

If case (ii) and (iii) arise proceed to Phase II.

Phase II

Use the optimum basic feasible solution of Phase I as a starting solution for the original LPP.

Assign the actual costs to the variables in the objective function and a cost 0 to every artificial variable in

the basis at zero level.

Delete the artificial variables column from the simplex tableau which is eliminated from the basis in Phase

I.

Apply simplex method to the modified simplex tableau obtained at the end of Phase I till an optimum

basic feasible solution is obtained or till there is an indication of unbounded solution

Remark:

1. In Phase I, the iterations are stopped as soon as the value of the new (artificial) objective function becomes

zero because this is its minimum value. There is no need to continue till the optimality reached if this value

becomes zero earlier than that.

2. Note that the new objective function is always of maximisation type whether the given original problem is

maximisation or minimisation type.

3. Before starting Phase II, remove all artificial variables from Tableau which were non-basic at the end of

Phase I.

(Cf. Lecture Note 1e, c.f., Example 3) Solve the following LPP

Maximise z = 3x1 x2

subject to

x1 x2

x1

10

20

x1 , x2 0

(Cf. Lecture Note 1e, c.f., Example 4) Solve the following LPP

Maximise z = 2x1 + x2

subject to

x1 x2

2x1 x2

10

40

x1 0, x2 0

- Intelligence & Synergy of EveryoneUploaded byLance Legel
- or.pdfUploaded bysundar1469
- Evalutionary AlgthUploaded byMoshira Essam
- MINLPUploaded byFebriza Imansuri
- olhaes de içamentoUploaded byDavid Uribe
- note2-graphicalmethodUploaded byアユ ギタ
- 14, 42, 61 or1 lp.pptUploaded byPaola Pecolera
- Linear ProgrammingUploaded byRusselArevalo
- 1-s2.0-0024630174900818-mainUploaded byVitor Feitoza
- or assignUploaded byJayakrishnan Unnikrishnan
- 206C-Computer Based Optimization Techniques.pdfUploaded bySaranya Dhilipkumar
- operation researchUploaded bykamun0
- Chapter 5Uploaded byAnton Ndelitunga Lungameni
- 15 marks QTUploaded byprabhakar_29-1
- 251C-Quantitative Methods for ManagementUploaded bySreejith C Varma
- The Tactical Berth Allocation Problem With Quay Crane Assignment and TranUploaded byEdwina Seviera
- Manual de MPLUploaded bypraxtorres52
- D1,L9 Linear Programming.pptUploaded bymokhtarppg
- Bi-level Linear Programming Problem with Neutrosophic NumbersUploaded byMia Amalia
- 4th Semester, Applied Operations ResearchUploaded byZid Zid
- saphores_CEE111w17_Lec6Uploaded byeeururu539
- Pertemuan 3 OrUploaded bySalvador Guzmán
- lect2Uploaded byAnit Kumar Jain
- slack1Uploaded bydhirendra
- 20121226100220643Uploaded bydavid__mine
- Samiksha DasUploaded byRationallyIrrationalSamiksha
- note 01Uploaded byAshfaque Ul Haque Siddiquie
- MeasurIT Flexim ADM ShurgraphD Project DL 0906Uploaded bycwiejkowska
- Chap004 SalesUploaded bynicholas6678
- Basu2016 - CopyUploaded bySakthivel Padaiyatchi

- sol3.pdfUploaded byjulianli0220
- Kayser ViolinUploaded byRicardo A Martinez
- IMSLP25444-PMLP56123-School of Violin Technique Op.1 Book2 for ViolinUploaded byNicolae Filip
- Sevcik School of Violin Technique Op1 Book3Uploaded byjulianli0220
- sol2.pdfUploaded byjulianli0220
- Sevcik School of Violin Technique Op.1 Book1Uploaded byRicky Tobing
- Sevcik School of Violin Technique Op1 Book4Uploaded byjulianli0220
- assignment1.pdfUploaded byjulianli0220
- assignment 3.pdfUploaded byjulianli0220
- Tut3.pdfUploaded byjulianli0220
- Tut6 Sample FDM & FEM.pdfUploaded byjulianli0220
- assignment 2.pdfUploaded byjulianli0220
- Tut1.pdfUploaded byjulianli0220
- Tut4.pdfUploaded byjulianli0220
- Tut2.pdfUploaded byjulianli0220
- MAT3310-5-1_on_the_web.pdfUploaded byjulianli0220
- sol1.pdfUploaded byjulianli0220
- MAT3310-1_on_the_web.pdfUploaded byjulianli0220
- midterm.pdfUploaded byjulianli0220
- MAT3310-4_on_the_web.pdfUploaded byjulianli0220
- MAT3310-2_on_the_web.pdfUploaded byjulianli0220
- Assignment 4Uploaded byjulianli0220
- MAT3310-3_on_the_web.pdfUploaded byjulianli0220
- midsol.pdfUploaded byjulianli0220
- Jcp ArticleUploaded byjulianli0220
- 10.1.1.125.7079Uploaded byjulianli0220
- otws2_7351Uploaded byjulianli0220
- chap06Uploaded byjulianli0220
- chap07Uploaded byjulianli0220

- On Selection of Periodic KernelsUploaded byCS & IT
- Robust Video Data Hiding Using Forbidden Data HidingUploaded bynandhaaceece
- Exactitud y PrecisiónUploaded byAle Belletti
- An Overview of the Decimation Process and Its VLSI Implementation (1)Uploaded byneku
- Sat Practice Test 2 Answers.25 28Uploaded byTracy Martin
- REMOTE HEALTH MONITORING SYSTEM USING HEALTHY PIUploaded byTJPRC Publications
- Applied Mathematics in Engineering and ReliabilityUploaded byG Delis
- Pattern Recognition in VideoUploaded byshepigor
- ch8.5-Fall08Uploaded byltl9999
- Automata-2008_ Theory and Applications of Cellular AutomataUploaded byCésar Castellanos
- scipy-ref-0.17.0Uploaded byAnonymous I4joPP
- MNR_9695_sm_TableC1Uploaded byΔημήτριος Κρινής
- Critical Chain VS Critical Path MethodUploaded byarvindkaushik
- A Survey: Hypergraph Partitioning TechniquesUploaded byInternational Journal for Scientific Research and Development - IJSRD
- 1203.5731v1Uploaded byAbhishek Chanda
- Obstacle Avoidance in Mobile Robot Using Neural Network---IEEE2011Uploaded bySVSEMBEDDED
- Simulation of Parallel Pipeline Radix 2^2 ArchitectureUploaded byEditor IJRITCC
- First and Follow SetUploaded byapi-3696125
- Data Structures TestUploaded byMosomi Machoka Selvon
- A Frequency Domain Method for Real-Time Detection of.pdfUploaded byMarcusMiller
- Channel Estimation in OFDM Systems - AN3059Uploaded bygvkk123
- math 1010 newlinear programming eportfolioUploaded byapi-272665716
- Diagnosis Autism by Fisher Linear Discriminant Analysis FLDA via EEGUploaded bygdenunzio
- H0714954.pdfUploaded byFulki Kautsar S
- MATH_F211_1022.pdfUploaded byKoustubh Gupta
- HmmUploaded bymmmm
- Introduction ModelingUploaded byanindyatamin
- UT Dallas Syllabus for ee2300.501 05f taught by Edward Esposito (exe010200)Uploaded byUT Dallas Provost's Technology Group
- A Case Study in Text Mining: Interpreting Twitter Data From World Cup Tweets - 1408.5427Uploaded byann sophie
- IRR and NPV.pptUploaded byAbdul Qayyum