16 views

Uploaded by mizmell

Attribution Non-Commercial (BY-NC)

- Determination of Optimal Product Mix for Profit Maximization using Linear Programming
- Mechanical Engineering 2006 Sem VII
- 10.1.1.108.3204
- Mathematics III Jan2003 or 220556
- Simplex Mthd 3 Imp
- 4 Noded FEM-Class Notes
- Lingo 14 Users Manual
- Formulation of a Linear Programming
- Organizational Research
- Mining
- Functional equations exercises
- l1014
- Lecture25.pdf
- -Ch9-LP.docx
- n107p095
- SK
- Chapter 5
- Anna University II Sem
- Thesis Guide
- 1.07 Linear Programming

You are on page 1of 16

There are a number of ways in which to solve the

linear programming problem that we looked at in the last lesson. 1 You can draw the equations graphically and then i Solve by evaluating the vertices. ii Solve using the ruler method. 2 You can apply the Simplex Algorithm (this is not in the D1 syllabus and we will not be studying this) Taking last weeks example, we are going to look at representing the algebra graphically and then we will consider both methods to solve this problem.

Final - Problem

Lets consider the example we looked at in lesson 7.

14 12 10 8 6 4 2 0 0

i.e And

Craftsman Machine

10

15

20

To draw 5x + 5y = 60 and 2x + 3y = 30 find the intersections with both axes. x=0 y=12 and y=0 x=12 the line joins (0,12) and (12,0). x=0 y=10 and y=0 x=15 the line joins (0,10) and (15,0)

14 12 10 8 6 4 2 0 0 5 10 15 20

As we know that x and y are both 0, we can shade in the

Craftsman Machine

14 12 10 8 6 4 2 0 0 5 10 15 20

We can now do a similar thing with the constraint inequalities. If 2x + 3y 30, then choose any point and plug in to the inequality. Using the point (2,2), 2 x 2 + 3 x 2 = 10, which is less than 30. From

Craftsman Machine

14 12 10 8 6 4 2 0 0 5 10 15 20 Craftsman Machine

Questions

1 Indicate on a diagram the region for which 5x + 3y 15 x 0, y 0 2 - Indicate on a diagram the region for which 4x + 3y 12 2x + 5y 10 x 0, y 0 3 - Indicate on a diagram the region for which 2x + y 8 y 7, x 3 x 0, y 0

Questions

4 Indicate on a diagram the region for which y + 2x 12 x 2, y 4 5 - Indicate on a diagram the region for which 3x + 2y 12 3x + y 6 x+y4 6 - Indicate on a diagram the region for which 3x + 2y 6 y 2x y0

14 12 10 8 6 4 2 0 0 5 10 15 20

The feasible region is all of the co-ordinates that lie in the un-

Craftsman Machine

shaded area. Remember that each co-ordinate (x,y) represents the number of each shed made.

14 12 10 8 6 4 2 0 0 5 10 15 20

The vertices of the feasible region are: (0,0), (12,0), (6,6) and (0,10). The co-ordinate (6,6) can be found by solving the simultaneous

Craftsman Machine

Simultaneous Equations

(6,6) is found by solving 2x+3y=30 and 5x+5y=60

simultaneously.

2x + 3y = 30 5x + 5y = 60

2x + 3y = 30 3x + 3y = 36

x=6

2 x 6 + 3y = 30 12 + 3y = 30 3y = 18 y=6

The maximum profit will come from the values of x and y at one

of the vertices. We can now find the value of the profit function at each of these points:

x 0 12 6 0

y 0 0 6 10

The ruler Method

14 12 10 8 6 4 2 0 0 5 10 15 20

You draw the object function 60x + 84y = P. (here pick P to be

Craftsman Machine

The ruler Method

14 12 10 8 6 4 2 0 0 5 10 15 20

Once you have drawn the line move it to the last point available

Craftsman Machine

The co-ordinate that it lands on will give you

the values of x and y that will optimise the function. Here, as we know already x = 6, y = 6. So P = 60x + 84y = 60 x 6 + 84 x 6 = 864

- Determination of Optimal Product Mix for Profit Maximization using Linear ProgrammingUploaded byAnonymous 7VPPkWS8O
- Mechanical Engineering 2006 Sem VIIUploaded bygearedmech
- 10.1.1.108.3204Uploaded byYared Adera
- Mathematics III Jan2003 or 220556Uploaded byNizam Institute of Engineering and Technology Library
- 4 Noded FEM-Class NotesUploaded byMuhammad Hassan
- Simplex Mthd 3 ImpUploaded byVinayak Ghatage
- Lingo 14 Users ManualUploaded byCristian Castillo Yachapa
- Formulation of a Linear ProgrammingUploaded bychandresh_johnson
- MiningUploaded bygmcnultyenergy
- Organizational ResearchUploaded bysiddharthsharmaz
- Functional equations exercisesUploaded byLinuxista Linuxsista
- l1014Uploaded byNigga Rajaa
- Lecture25.pdfUploaded byThe666RC
- -Ch9-LP.docxUploaded byالف تات
- n107p095Uploaded byJozef Kratica
- SKUploaded bySharania Udhaya Kumar
- Chapter 5Uploaded byNhut Nguyen
- Anna University II SemUploaded bysankar_p
- Thesis GuideUploaded byjoemar
- 1.07 Linear ProgrammingUploaded byrachel
- unit 1Uploaded byJhone sam
- 10.1.1.382.8505Uploaded byMaiane Junqueira
- TheveninUploaded byMateus Corato Zanarella
- Application of Fuzzy Multi-objective Linear Programming To Aggregate Production PlanningUploaded byTria Putri Noviasari
- Iitkgp or PapersUploaded byRitam Dutt
- Simplex 3Uploaded byRodolfo Sergio Cruz Fuentes
- Engg Maths 2 Jan 2018 (2014 Scheme)Uploaded bybharath s
- 1_pdfsam_Taylor_ModuleA_Simplex.pdfUploaded byJehad Selawe
- limit1Uploaded byrreee
- Core JavaUploaded byManoj Prasad

- Numbers Activity - Critical Path SolutionsUploaded bymizmell
- Activity Networks Example 3matematikUploaded bymizmell
- 4.1Uploaded bymizmell
- Task-Numbers Activity - Critical PathUploaded bymizmell
- D1 2008-06 MSUploaded bymizmell
- D1 June 2007Uploaded byRoNi Jason James Stinson
- D1 2011-01Uploaded byEugene Zhang
- D1 Exercise 1fUploaded bysidahmelda
- D1,L9 Solving Linear Programming ProblemsUploaded bymizmell
- D1,L5 1 Kruskal's and Prim's AlgorithmsUploaded bymizmell
- D1,L8 Critical Path AnalysisUploaded bymizmell
- D1,L8 Critical Path Analysis Early Event Time ExamplesUploaded bymizmell
- D1,L7 Chinese Postman.pptUploaded bymokhtarppg
- D1,L8 Critical Path Gantt DiagramsUploaded bymizmell
- D1 2004-11Uploaded bymizmell
- D1 2005-06Uploaded bymizmell
- D1 2006-01Uploaded bymizmell
- D1 2006-06 MSUploaded bymizmell
- D1 2006-06Uploaded bymizmell
- D1 2007-01 MSUploaded bymizmell
- D1 2007-06 MSUploaded bymizmell
- D1 2008-01Uploaded bymizmell
- D1 2008-06Uploaded bymizmell

- APSMO_1_2012_SolnUploaded byFred Pong
- Spin Dynamics Study of 1D Heisenberg ModelUploaded byt_sairam
- _mathematic inductionUploaded byPanittha Suwannajang
- MA252 - Combinatorial OptimisationUploaded byRebecca Rumsey
- conformal mappingUploaded byHarsh Vardhan
- Huge (2014) - How to Construct a Volatility SurfaceUploaded byFrido Rolloos
- Power Flow StudyUploaded byBenedict Nemine
- Quadritic EquationUploaded bypjojibabu
- chap14-et-student-solutionsUploaded byapi-19961526
- Newton Raphson MethodUploaded byMhdiBghri
- 21 Functions Part 1 of 3Uploaded bySunil Das
- Fourier MathcadUploaded byAlberto Olvera
- Greens TheoremUploaded bypalsetty
- Probim Addmath T4 2017Uploaded byAnonymous 8nGadU1Vjb
- Convexity ProblemsUploaded byyemresimsek
- IFEM.Ch03Uploaded byapi-3698788
- The Fractional Fourier Transform and Its ApplicationsUploaded byCarlos Francisco Herrera
- DynamicProgUploaded bySaranya Uvangelin
- Mat223 UTM Midterm UofTUploaded byRevownSada
- TraforettoTacticaAdversaENG_38c17Uploaded byCristina Fernandez
- EDF-Tutorial-101.pdfUploaded byArianta Rian
- CH08.pdfUploaded bypesta
- Havelock: Complete WorksUploaded byMark Trujillo
- lec6.pdfUploaded bysuntararaajan
- Minimum Variance Portfolio ExampleUploaded byDaniel Dunlap
- Time Series Analysis by salah uddinUploaded byNazim Uddin Mahmud
- Fisika latihan soal dan theoryUploaded byEdyWidjaja
- ESW-Lab-3(2016).pdfUploaded byKil Bha
- pre-calculus 2017-2018 term 3 assignment sohee hanUploaded byapi-369740044
- Application 8Uploaded byDr. Ir. R. Didin Kusdian, MT.