2 views

Uploaded by Talha Maqsood

Management Sciences

- mca-18-00438
- A Two-Stage Integer Linear Programming-Based Droplet Routing Algorithm for Pin-Constrained Digital Microfluidic Biochips
- Duality
- SW Press Frame Opt Example
- Quanti-V1 (1)
- Simplex Method
- AggPlanning_Chapter03
- 12 Maths Key Notes Ch 12 Linear Programming
- 06-12-01-sol.ps
- eumc_w18_isernia_nov_1_12
- Method for Solu Tio 00 We In
- Pi Controller Tuning
- Thesis - Steel Design Optimization
- Operations Research
- Linear Programming.ppt
- Asset Liability Management
- Paper 13
- ANN Modeling and GA Optimization of Zinc Removal from Wash water by Electro-coagulation Process
- 10.1.1.121
- Project Abstract

You are on page 1of 30

& Decision Analysis

A Practical Introduction to

Management Science

5th edition

Cliff T. Ragsdale

Chapter 2

Introduction to Optimization

and Linear Programming

Introduction

We all face decision about how to use

limited resources such as:

– Oil in the earth

– Land for dumps

– Time

– Money

– Workers

k. or most efficient. a. MP is a field of management science that finds the optimal. Optimization .. way of using limited resources to achieve the objectives of an individual of a business.Mathematical Programming..a.

Applications of Optimization Determining Product Mix Manufacturing Routing and Logistics Financial Planning .

Characteristics of Optimization Problems Decisions Constraints Objectives .

General Form of an Optimization Problem MAX (or MIN): f0(X1. Xn)<=b1 : fk(X1. Xn)=bm Note: If all the functions in an optimization are linear. the problem is a Linear Programming (LP) problem . …. X2. …. X2. …. X2. …. Xn) Subject to: f1(X1. Xn)>=bk : fm(X1. X2.

Linear Programming (LP) Problems MAX (or MIN): c1X1 + c2X2 + … + cnXn Subject to: a11X1 + a12X2 + … + a1nXn <= b1 : ak1X1 + ak2X2 + … + aknXn >=bk : am1X1 + am2X2 + … + amnXn = bm .

An Example LP Problem Blue Ridge Hot Tubs produces two types of hot tubs: Aqua-Spas & Hydro-Luxes. . and 2880 feet of tubing available. Pumps Labor Tubing Unit Profit Aqua-Spa 1 9 hours 12 feet $350 Hydro-Lux 1 6 hours 16 feet $300 There are 200 pumps. 1566 hours of labor.

2. Understand the problem.5 Steps In Formulating LP Models: 1. X1=number of Aqua-Spas to produce X2=number of Hydro-Luxes to produce 3. MAX: 350X1 + 300X2 . Identify the decision variables. State the objective function as a linear combination of the decision variables.

5 Steps In Formulating LP Models (continued) 4. State the constraints as linear combinations of the decision variables. 1X1 + 1X2 <= 200 } pumps 9X1 + 6X2 <= 1566 } labor 12X1 + 16X2 <= 2880} tubing 5. X1 >= 0 X2 >= 0 . Identify any upper or lower bounds on the decision variables.

T.LP Model for Blue Ridge Hot Tubs MAX: 350X1 + 300X2 S.: 1X1 + 1X2 <= 200 9X1 + 6X2 <= 1566 12X1 + 16X2 <= 2880 X1 >= 0 X2 >= 0 .

so let’s make as many of them as possible! How many would that be? – Let X2 = 0 1st constraint: 1X1 <= 200 2nd constraint: 3rd constraint: 9X1 <=1566 or X1 <=174 12X1 <= 2880 or X1 <= 240 If X2=0.Solving LP Problems: An Intuitive Approach Idea: Each Aqua-Spa (X1) generates the highest unit profit ($350).900 This solution is feasible. but is it optimal? No! . the maximum value of X1 is 174 and the total profit is $350*174 + $300*0 = $60.

. For LP problems with 2 variables. it is easy to plot the feasible region and find the optimal solution. The best point in the feasible region is the optimal solution to the problem.Solving LP Problems: A Graphical Approach The constraints of an LP problem defines its feasible region.

X2 Plotting the First Constraint 250 (0. 200) 200 boundary line of pump constraint X1 + X2 = 200 150 100 50 (200. 0) 0 0 50 100 150 200 250 X1 .

261) X2 250 boundary line of labor constraint 9X1 + 6X2 = 1566 200 150 100 50 (174. 0) 0 0 50 100 150 200 250 X1 .Plotting the Second Constraint (0.

180) 200 150 boundary line of tubing constraint 12X1 + 16X2 = 2880 100 Feasible Region 50 (240.X2 Plotting the Third Constraint 250 (0. 0) 0 0 50 100 150 200 250 X1 .

67) 150 objective function 350X1 + 300X2 = 35000 100 (100.Plotting A Level Curve of the Objective Function X2 250 200 (0. 0) 50 0 0 50 100 150 200 250 X1 . 116.

0) 50 0 0 50 100 150 200 250 X1 .A Second Level Curve of the Objective Function X2 250 (0. 175) 200 objective function 350X1 + 300X2 = 35000 objective function 350X1 + 300X2 = 52500 150 100 (150.

X2 Using A Level Curve to Locate the Optimal Solution 250 objective function 350X1 + 300X2 = 35000 200 150 optimal solution 100 objective function 350X1 + 300X2 = 52500 50 0 0 50 100 150 200 250 X1 .

X2=200-X1=78 Total Profit = $350*122 + $300*78 = $66. X1=122.Calculating the Optimal Solution The optimal solution occurs where the “pumps” and “labor” constraints intersect. This occurs where: X1 + X2 = 200 (1) and 9X1 + 6X2 = 1566 (2) From (1) we have.100 . 9X1 + 6 (200 -X1) = 1566 which reduces to X1 = 122 So the optimal solution is. X2 = 200 -X1(3) Substituting (3) for X2 in (2) we have.

900 (174.100 (122.000 150 (80.X2 Enumerating The Corner Points 250 obj. 0) 0 0 50 100 150 200 250 X1 . 78) 100 50 obj. obj. value = $0 (0. value = $54.000 (0. value = $64. value = $60. 180) 200 Note: This technique will not work if the solution is unbounded. 0) obj. value = $66. 120) obj.

Identify the feasible region 3. Plotting level curves b.Summary of Graphical Solution to LP Problems 1. Enumerating the extreme points . Plot the boundary line of each constraint 2. Locate the optimal solution by either: a.

xls .Understanding How Things Change See file Fig2-8.

Special Conditions in LP Models A number of anomalies can occur in LP problems: – Alternate Optimal Solutions – Redundant Constraints – Unbounded Solutions – Infeasibility .

Example of Alternate Optimal Solutions X2 250 objective function level curve 450X1 + 300X2 = 78300 200 150 100 alternate optimal solutions 50 0 0 50 100 150 200 250 X1 .

Example of a Redundant Constraint X2 250 boundary line of tubing constraint 200 boundary line of pump constraint 150 boundary line of labor constraint 100 Feasible Region 50 0 0 50 100 150 200 250 X1 .

Example of an Unbounded Solution X2 1000 objective function X1 + X2 = 600 800 -X1 + 2X2 = 400 objective function X1 + X2 = 800 600 400 200 X1 + X2 = 400 0 0 200 400 600 800 1000 X1 .

Example of Infeasibility X2 250 200 X1 + X2 = 200 feasible region for second constraint 150 100 feasible region for first constraint 50 X1 + X2 = 150 0 0 50 100 150 200 250 X1 .

End of Chapter 2 .

- mca-18-00438Uploaded byFederico.Iori
- A Two-Stage Integer Linear Programming-Based Droplet Routing Algorithm for Pin-Constrained Digital Microfluidic BiochipsUploaded byspiderman86
- DualityUploaded byRiaz Rahman Bony
- SW Press Frame Opt ExampleUploaded byMX100
- Quanti-V1 (1)Uploaded byHirizza Junko Yamamoto
- Simplex MethodUploaded bybaboonijj
- AggPlanning_Chapter03Uploaded byRameez Sajid
- 12 Maths Key Notes Ch 12 Linear ProgrammingUploaded bySachin Yadav
- 06-12-01-sol.psUploaded bysalim
- eumc_w18_isernia_nov_1_12Uploaded bylaboratoriolemma
- Method for Solu Tio 00 We InUploaded byAdela-Adriana Sandulescu
- Pi Controller TuningUploaded byanoopeluvathingal100
- Thesis - Steel Design OptimizationUploaded bycargadory2k
- Operations ResearchUploaded byKiran Datar
- Linear Programming.pptUploaded byShivam Agarwal
- Asset Liability ManagementUploaded byazeemQFMBA
- Paper 13Uploaded byRakeshconclave
- ANN Modeling and GA Optimization of Zinc Removal from Wash water by Electro-coagulation ProcessUploaded byRahul Sharma
- 10.1.1.121Uploaded byHendrico JayChou
- Project AbstractUploaded bysonymtech
- Sap Notes - FinalsUploaded byAnand Kumar
- Optimal management of a theoretical coastal aquifer with combined pollution and salinization problems, using genetic algorithmsUploaded byGuy 81
- Cascading Flowlines and Layout ModulesUploaded byOrchid Corn
- Lm 2519942003Uploaded byAnonymous 7VPPkWS8O
- 1-s2.0-S0261306909001824-main.pdfUploaded byKailas Gophane
- lecture09-knapsackUploaded byRashedul Islam
- Byron K. Williams, James D. Nichols, Michael J. Conroy - Analysis and Management of Animal Populations-Academic Press (2002).pdfUploaded byJulio San Martín Órdenes
- OR_HW_F02_Soln_1to3Uploaded byDinesh
- 0182Uploaded byHarsha
- Binder1 35.pdfUploaded byAbdul Rahman

- Bank DataUploaded byTalha Maqsood
- Bank DataUploaded byTalha Maqsood
- Problems+for+Session+06Uploaded byTalha Maqsood
- 4024_s08_qp_1Uploaded byTalha Maqsood
- Chapter+01Uploaded byTalha Maqsood
- Chapter+01Uploaded byTalha Maqsood
- 2281_s05_qp_1Uploaded byTalha Maqsood
- 2281_s08_qp_2Uploaded byTalha Maqsood
- 2281_s06_qp_2Uploaded byTalha Maqsood
- 2281_s05_qp_2Uploaded byTalha Maqsood
- 2281_s06_qp_1Uploaded byTalha Maqsood

- H0714954.pdfUploaded byFulki Kautsar S
- Referencias bibliografica industrialUploaded byeddedd1
- greedy-dpUploaded bychirusagar
- HSSC-II Short Notes Ch 5Uploaded byPaje Qad
- DegeneracyUploaded byJohanna Martinne Canlas
- LPP TOTALUploaded byJatin Thakkar
- EcoUploaded byDaisy Gogorza
- Gradient Descent - KonsepUploaded byyoungwencie
- Review of Scheduling AlgorithmsUploaded byJose Gonzales
- d vijay kumar.pdfUploaded byVijay Pandit
- p-median model facility locationUploaded byRahul Arora
- M1L4slidesUploaded byShamendu Roy Rohit
- Lecture 12Uploaded byshamsukarim2009
- Coordination of Directional Overcurrent Relays Using Seeker AlgoUploaded bySoumikDas
- ORUploaded byHarsha Kasaragod
- IAT II AOR BA 7206Uploaded byVimalnath Venkatasubramanian
- optimization Lecture 2Uploaded byKatie Cook
- A Algorithm for Global Optimization Problems BasedUploaded byElkin Petro
- Or Question GivenUploaded byArunangshu Ray
- 23+ +Linear+ProgrammingUploaded byGaurav Agarwal
- Decision Analysis(Full)Uploaded byveitafaenjeg
- Stephen Boyd 1Uploaded byminhthangbk
- Operations Research II, Topic 1-6 (1)Uploaded byKafonyi John
- Mopso GuideUploaded byHarshyt GOel
- Oregon Trail Game Hand OutUploaded byjsayer622
- M1L4_LNUploaded bysantosprsd
- ORUploaded byElla Joyce
- Using GRASP to Solve the Unit Commitment ProblemUploaded bybelcourt
- wangling379936-self-200812-34Uploaded bySakthiPriya
- Constraint QualificationUploaded bycharles luis