Operations Research

© All Rights Reserved

7 views

Operations Research

© All Rights Reserved

- Body Schema Acquisition through Active Learning
- 12 Linear Programming
- OPERATION RESEARCH 2 mark questions with answers.docx
- 14_Linear Programming.pdf
- Nonlinear Programming III
- Excel Basic Optimization
- Problems
- 3D Seismic Survey Design Optimization
- Operational Research Chapter 3 solution hilier
- Maths for Finance Chapter 3.pdf
- Kannan 1994
- APPLICATION OF THE MICROSOFT EXCEL SOLVER TOOL IN THE SOLUTION OF OPTIMIZATION PROBLEMS OF HEAT EXCHANGER NETWORK SYSTEMS
- SMDA6e Chapter 02.doc
- Matlab Programs
- linear programing example excel solver.pdf
- Chapter 3 - Deriving Solutions from a Linedeear Optimization Model.pdf
- CH1
- Op Tim is at Ion
- Math programming
- Class Handout # 4 - R

You are on page 1of 8

Feasible Region

Linear Programming

(Graphical Method)

It is the collection of all feasible solutions. In the following figure, the shaded area represents the feasible region.

1.

2. Treat inequalities as equalities and then draw the lines corresponding to each equation and non-negativity restrictions. 3. Locate the end points (corner points) on the feasible region. 4. Determine the value of the objective function corresponding to the end points determined in step 3. 5. Find out the optimal value of the objective function.

Problem

A factory produces two types of raw mortar i.e. lean mix mortar and rich mix mortar. Two basic materials, Cement and Sand are used to produce the mixes. The maximum availability of cement is 800 cu.ft a day; that of sand is 3000 cu.ft a day. The requirement of cement and sand per cu.ft of rich and lean mix is given as under:

Rich Mix Lean Mix

Sand (cu.ft)

500 0.3

1.0

300 0.2

1.0

A market survey has established that the daily demand for the lean mix does not exceed that of rich mix by more than 1000 cu.ft. The maximum demand for lean mix is limited to 1200 cu.ft

How much rich and lean mixes should be produced daily to maximize gross income?

1.

Objective Function Z = 500 x1 + 300 x2 (i) (ii) (iii) (iv) (v) Constraints 0.3 x1 + 0.2x2 800 (Cement) x1 + x2 3000 (Sand) x2 x1 1000 ( relative diff. of lean and rich) x2 1200 ( lean) x1 0, x2 0 (non negativity)

5000 4000 3000

Constraint Equations

5000

x1 + x2 3000

(ii)

x2

(i)

x2

2000

1000

0 0 1000 2000 3000 4000 5000

1000

2000

3000

4000

5000

x1

5000 4000

x1

x2 1200

(iv)

x2

x2 - x1 1000

(iii)

x2

3000

2000

1000 0 0 1000 2000 3000 4000 5000

x1

x1

Constraint Equations

x2

x1

Z = 500 x1 + 300 x2

B A C D

x2

500

O

-300

x1

Z-Line

Lines for different values of Z are drawn parallel to Z line passing through origin O which has been constructed by equating Z = 500 x1 + 300 x2 = 0, giving x1/x2 = -300 / 500

For different values of decision variables, the values obtained for Z are given in following table. Z = 500 x1 + 300 x2

Corner Origin A B C D E

- Body Schema Acquisition through Active LearningUploaded byAdam Rice
- 12 Linear ProgrammingUploaded byHarsh Ravi
- OPERATION RESEARCH 2 mark questions with answers.docxUploaded byM.Thirunavukkarasu
- 14_Linear Programming.pdfUploaded bythinkiit
- Nonlinear Programming IIIUploaded byKarla Venegas Vega
- Excel Basic OptimizationUploaded byTaniadi Suria
- ProblemsUploaded byerad_5
- 3D Seismic Survey Design OptimizationUploaded bySuta Vijaya
- Operational Research Chapter 3 solution hilierUploaded byAjeya Acharya
- Maths for Finance Chapter 3.pdfUploaded byWonde Biru
- Kannan 1994Uploaded bysleriphocr
- APPLICATION OF THE MICROSOFT EXCEL SOLVER TOOL IN THE SOLUTION OF OPTIMIZATION PROBLEMS OF HEAT EXCHANGER NETWORK SYSTEMSUploaded byDaniel Alcala
- SMDA6e Chapter 02.docUploaded byGopalakrishna Chaitanya
- Matlab ProgramsUploaded byxorand
- linear programing example excel solver.pdfUploaded byAli Mohsen
- Chapter 3 - Deriving Solutions from a Linedeear Optimization Model.pdfUploaded byTanmay Sharma
- CH1Uploaded byprasaad08
- Op Tim is at IonUploaded byshakil_07
- Math programmingUploaded byPadmaja Ch
- Class Handout # 4 - RUploaded byTaariq Abdul-Majeed
- MIT15_053S13_lec3.pdfUploaded byShashank Singla
- maths1Uploaded byapi-341496321
- DSC4213-2016-3 notesUploaded bySabina Tan
- Chapter 3cUploaded byBanshi Jakhar
- FM Lesson LP2Uploaded bysparrowjakazz
- Midterm AUploaded byGlenn Candranegara
- 15.SCM - Inventory ManagementUploaded byWah Wah Khaing
- Appraisal of Optimal Production Quantity in Small and Medium Scale IndustryUploaded byijaert
- 2400_final_2014_Winter.pdfUploaded byMallory Ennis
- 00386007Uploaded bytousif_1994_111

- thermalUploaded byNora Guzman
- MATH21Uploaded byIsrael Lives
- Lecture20.pdfUploaded byRamonErnestoIC
- SAS Date_Time FunctionsUploaded bySubhrajit Samantray
- 5.10-Working_with_Raster_Calculator.pdfUploaded byAnonymous TWzli5
- C Language MCQ Bank.pdfUploaded bybheemsinghsaini
- SAS SUGI PaperUploaded bybiswarup1988
- Embedded MATLABUploaded byDhanya Ramaswamy
- DPMath211Uploaded byJessica Nasayao
- Stephan EnglUploaded bygennaro_basile
- Evaluation Multiple ZetaUploaded bylsunart
- yuytuUploaded bykay50
- Calcula DoraUploaded byIsabel Antunes
- study guide summative 3- function notation 2017-2018Uploaded byapi-366582437
- Past Exam Papers Function Geometry Trigo 1Uploaded byOliver Shand
- SyllabusUploaded byBhavya Sri
- catalog_sipart_DR20 (1).pdfUploaded byRodrigo Herrera
- (Undergraduate Texts in Mathematics) Kai Lai Chung, Farid AitSahlia (auth.)-Elementary Probability Theory_ With Stochastic Processes and an Introduction to Mathematical Finance-Springer-Verlag New Yor.pdfUploaded byCecilio Sánchez Fernández
- Algebra 2 Lesson Plan 5.4Uploaded byhoudini4
- PLAXIS-3D Dam StabilityUploaded byjimmysatanco
- 00019514Uploaded byvitmol
- Matlab Training - Simulating Dynamic SystemsUploaded byhamed
- Klein-Gordon EquationsUploaded byCecilia Déciga
- dlnmUploaded byArdelia Luthfiyah
- A Machine Learning Introductory Tutorial With Examples _ ToptalUploaded byGuilherme Germano
- R TipsUploaded byopiumcon
- Function Part2Uploaded byong kar weng
- ssa sylUploaded byManish
- 3110015Uploaded byMeet
- qualitfyUploaded bysumairmohi