Submit Search
Upload
Introductory maths analysis chapter 07 official
•
Download as PPT, PDF
•
0 likes
•
641 views
Evert Sandye Taasiringan
Follow
Matematika Bisnis
Read less
Read more
Technology
Business
Report
Share
Report
Share
1 of 23
Download now
Recommended
Introductory maths analysis chapter 06 official
Introductory maths analysis chapter 06 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 16 official
Introductory maths analysis chapter 16 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 14 official
Introductory maths analysis chapter 14 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 13 official
Introductory maths analysis chapter 13 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 01 official
Introductory maths analysis chapter 01 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 03 official
Introductory maths analysis chapter 03 official
Evert Sandye Taasiringan
Chapter 1 - Applications and More Algebra
Chapter 1 - Applications and More Algebra
Muhammad Bilal Khairuddin
Introductory maths analysis chapter 15 official
Introductory maths analysis chapter 15 official
Evert Sandye Taasiringan
Recommended
Introductory maths analysis chapter 06 official
Introductory maths analysis chapter 06 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 16 official
Introductory maths analysis chapter 16 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 14 official
Introductory maths analysis chapter 14 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 13 official
Introductory maths analysis chapter 13 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 01 official
Introductory maths analysis chapter 01 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 03 official
Introductory maths analysis chapter 03 official
Evert Sandye Taasiringan
Chapter 1 - Applications and More Algebra
Chapter 1 - Applications and More Algebra
Muhammad Bilal Khairuddin
Introductory maths analysis chapter 15 official
Introductory maths analysis chapter 15 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 09 official
Introductory maths analysis chapter 09 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 12 official
Introductory maths analysis chapter 12 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 11 official
Introductory maths analysis chapter 11 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 00 official
Introductory maths analysis chapter 00 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 17 official
Introductory maths analysis chapter 17 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 10 official
Introductory maths analysis chapter 10 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 08 official
Introductory maths analysis chapter 08 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 04 official
Introductory maths analysis chapter 04 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 05 official
Introductory maths analysis chapter 05 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 02 official
Introductory maths analysis chapter 02 official
Evert Sandye Taasiringan
Chapter0 reviewofalgebra-151003150137-lva1-app6891
Chapter0 reviewofalgebra-151003150137-lva1-app6891
Cleophas Rwemera
Chapter12 additionaldifferentiationtopics-151003154510-lva1-app6891
Chapter12 additionaldifferentiationtopics-151003154510-lva1-app6891
Cleophas Rwemera
Chapter 12 - Additional Differentiation Topics
Chapter 12 - Additional Differentiation Topics
Muhammad Bilal Khairuddin
LP linear programming (summary) (5s)
LP linear programming (summary) (5s)
Dionísio Carmo-Neto
Chapter 6 - Matrix Algebra
Chapter 6 - Matrix Algebra
Muhammad Bilal Khairuddin
Chapter6 matrixalgebra-151003151111-lva1-app6892
Chapter6 matrixalgebra-151003151111-lva1-app6892
Cleophas Rwemera
Convex optmization in communications
Convex optmization in communications
Deepshika Reddy
Linear Programing.pptx
Linear Programing.pptx
AdnanHaleem
Chapter1 applicationsandmorealgebra-151003144938-lva1-app6891
Chapter1 applicationsandmorealgebra-151003144938-lva1-app6891
Cleophas Rwemera
CE 502 Computational Techniques
CE 502 Computational Techniques
Md.Asif Rahman
Linear Programming
Linear Programming
Rashid Ansari
Chapter 17 - Multivariable Calculus
Chapter 17 - Multivariable Calculus
Muhammad Bilal Khairuddin
More Related Content
What's hot
Introductory maths analysis chapter 09 official
Introductory maths analysis chapter 09 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 12 official
Introductory maths analysis chapter 12 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 11 official
Introductory maths analysis chapter 11 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 00 official
Introductory maths analysis chapter 00 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 17 official
Introductory maths analysis chapter 17 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 10 official
Introductory maths analysis chapter 10 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 08 official
Introductory maths analysis chapter 08 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 04 official
Introductory maths analysis chapter 04 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 05 official
Introductory maths analysis chapter 05 official
Evert Sandye Taasiringan
Introductory maths analysis chapter 02 official
Introductory maths analysis chapter 02 official
Evert Sandye Taasiringan
What's hot
(10)
Introductory maths analysis chapter 09 official
Introductory maths analysis chapter 09 official
Introductory maths analysis chapter 12 official
Introductory maths analysis chapter 12 official
Introductory maths analysis chapter 11 official
Introductory maths analysis chapter 11 official
Introductory maths analysis chapter 00 official
Introductory maths analysis chapter 00 official
Introductory maths analysis chapter 17 official
Introductory maths analysis chapter 17 official
Introductory maths analysis chapter 10 official
Introductory maths analysis chapter 10 official
Introductory maths analysis chapter 08 official
Introductory maths analysis chapter 08 official
Introductory maths analysis chapter 04 official
Introductory maths analysis chapter 04 official
Introductory maths analysis chapter 05 official
Introductory maths analysis chapter 05 official
Introductory maths analysis chapter 02 official
Introductory maths analysis chapter 02 official
Similar to Introductory maths analysis chapter 07 official
Chapter0 reviewofalgebra-151003150137-lva1-app6891
Chapter0 reviewofalgebra-151003150137-lva1-app6891
Cleophas Rwemera
Chapter12 additionaldifferentiationtopics-151003154510-lva1-app6891
Chapter12 additionaldifferentiationtopics-151003154510-lva1-app6891
Cleophas Rwemera
Chapter 12 - Additional Differentiation Topics
Chapter 12 - Additional Differentiation Topics
Muhammad Bilal Khairuddin
LP linear programming (summary) (5s)
LP linear programming (summary) (5s)
Dionísio Carmo-Neto
Chapter 6 - Matrix Algebra
Chapter 6 - Matrix Algebra
Muhammad Bilal Khairuddin
Chapter6 matrixalgebra-151003151111-lva1-app6892
Chapter6 matrixalgebra-151003151111-lva1-app6892
Cleophas Rwemera
Convex optmization in communications
Convex optmization in communications
Deepshika Reddy
Linear Programing.pptx
Linear Programing.pptx
AdnanHaleem
Chapter1 applicationsandmorealgebra-151003144938-lva1-app6891
Chapter1 applicationsandmorealgebra-151003144938-lva1-app6891
Cleophas Rwemera
CE 502 Computational Techniques
CE 502 Computational Techniques
Md.Asif Rahman
Linear Programming
Linear Programming
Rashid Ansari
Chapter 17 - Multivariable Calculus
Chapter 17 - Multivariable Calculus
Muhammad Bilal Khairuddin
Chapter17 multivariablecalculus-151007044001-lva1-app6891
Chapter17 multivariablecalculus-151007044001-lva1-app6891
Cleophas Rwemera
LPP, Duality and Game Theory
LPP, Duality and Game Theory
Purnima Pandit
Unit 2.pptx
Unit 2.pptx
asthashukla33
Integer Linear Programming
Integer Linear Programming
SukhpalRamanand
Simplex method material for operation .pptx
Simplex method material for operation .pptx
bizuayehuadmasu1
Chapter4 exponentialandlogarithmicfunctions-151003150209-lva1-app6891
Chapter4 exponentialandlogarithmicfunctions-151003150209-lva1-app6891
Cleophas Rwemera
Chapter 4 - Exponential and Logarithmic Functions
Chapter 4 - Exponential and Logarithmic Functions
Muhammad Bilal Khairuddin
Linear Programming (graphical method)
Linear Programming (graphical method)
Kamel Attar
Similar to Introductory maths analysis chapter 07 official
(20)
Chapter0 reviewofalgebra-151003150137-lva1-app6891
Chapter0 reviewofalgebra-151003150137-lva1-app6891
Chapter12 additionaldifferentiationtopics-151003154510-lva1-app6891
Chapter12 additionaldifferentiationtopics-151003154510-lva1-app6891
Chapter 12 - Additional Differentiation Topics
Chapter 12 - Additional Differentiation Topics
LP linear programming (summary) (5s)
LP linear programming (summary) (5s)
Chapter 6 - Matrix Algebra
Chapter 6 - Matrix Algebra
Chapter6 matrixalgebra-151003151111-lva1-app6892
Chapter6 matrixalgebra-151003151111-lva1-app6892
Convex optmization in communications
Convex optmization in communications
Linear Programing.pptx
Linear Programing.pptx
Chapter1 applicationsandmorealgebra-151003144938-lva1-app6891
Chapter1 applicationsandmorealgebra-151003144938-lva1-app6891
CE 502 Computational Techniques
CE 502 Computational Techniques
Linear Programming
Linear Programming
Chapter 17 - Multivariable Calculus
Chapter 17 - Multivariable Calculus
Chapter17 multivariablecalculus-151007044001-lva1-app6891
Chapter17 multivariablecalculus-151007044001-lva1-app6891
LPP, Duality and Game Theory
LPP, Duality and Game Theory
Unit 2.pptx
Unit 2.pptx
Integer Linear Programming
Integer Linear Programming
Simplex method material for operation .pptx
Simplex method material for operation .pptx
Chapter4 exponentialandlogarithmicfunctions-151003150209-lva1-app6891
Chapter4 exponentialandlogarithmicfunctions-151003150209-lva1-app6891
Chapter 4 - Exponential and Logarithmic Functions
Chapter 4 - Exponential and Logarithmic Functions
Linear Programming (graphical method)
Linear Programming (graphical method)
More from Evert Sandye Taasiringan
03 i-o
03 i-o
Evert Sandye Taasiringan
07 function 2
07 function 2
Evert Sandye Taasiringan
04 if-ifelse-switch-break
04 if-ifelse-switch-break
Evert Sandye Taasiringan
05 for-dowhile-while
05 for-dowhile-while
Evert Sandye Taasiringan
06 nested
06 nested
Evert Sandye Taasiringan
02 01-elemen
02 01-elemen
Evert Sandye Taasiringan
02 02-operasi
02 02-operasi
Evert Sandye Taasiringan
01 pseudocode
01 pseudocode
Evert Sandye Taasiringan
01 algoritma
01 algoritma
Evert Sandye Taasiringan
01 02-pseudocode
01 02-pseudocode
Evert Sandye Taasiringan
01 01-algoritma
01 01-algoritma
Evert Sandye Taasiringan
Pertemuan ke 1
Pertemuan ke 1
Evert Sandye Taasiringan
Manajemen operasional ringkasan uas
Manajemen operasional ringkasan uas
Evert Sandye Taasiringan
More from Evert Sandye Taasiringan
(13)
03 i-o
03 i-o
07 function 2
07 function 2
04 if-ifelse-switch-break
04 if-ifelse-switch-break
05 for-dowhile-while
05 for-dowhile-while
06 nested
06 nested
02 01-elemen
02 01-elemen
02 02-operasi
02 02-operasi
01 pseudocode
01 pseudocode
01 algoritma
01 algoritma
01 02-pseudocode
01 02-pseudocode
01 01-algoritma
01 01-algoritma
Pertemuan ke 1
Pertemuan ke 1
Manajemen operasional ringkasan uas
Manajemen operasional ringkasan uas
Recently uploaded
Corporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptx
Rustici Software
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
The Digital Insurer
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Drew Madelung
Apidays Singapore 2024 - Scalable LLM APIs for AI and Generative AI Applicati...
Apidays Singapore 2024 - Scalable LLM APIs for AI and Generative AI Applicati...
apidays
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
Zilliz
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
ThousandEyes
AWS Community Day CPH - Three problems of Terraform
AWS Community Day CPH - Three problems of Terraform
Andrey Devyatkin
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...
apidays
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Script
wesley chun
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
DianaGray10
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
MadyBayot
A Beginners Guide to Building a RAG App Using Open Source Milvus
A Beginners Guide to Building a RAG App Using Open Source Milvus
Zilliz
A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?
Igalia
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Deepika Singh
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
apidays
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Safe Software
MINDCTI Revenue Release Quarter One 2024
MINDCTI Revenue Release Quarter One 2024
MIND CTI
Apidays Singapore 2024 - Modernizing Securities Finance by Madhu Subbu
Apidays Singapore 2024 - Modernizing Securities Finance by Madhu Subbu
apidays
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Juan lago vázquez
Architecting Cloud Native Applications
Architecting Cloud Native Applications
WSO2
Recently uploaded
(20)
Corporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptx
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Apidays Singapore 2024 - Scalable LLM APIs for AI and Generative AI Applicati...
Apidays Singapore 2024 - Scalable LLM APIs for AI and Generative AI Applicati...
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
AWS Community Day CPH - Three problems of Terraform
AWS Community Day CPH - Three problems of Terraform
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Script
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
A Beginners Guide to Building a RAG App Using Open Source Milvus
A Beginners Guide to Building a RAG App Using Open Source Milvus
A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
MINDCTI Revenue Release Quarter One 2024
MINDCTI Revenue Release Quarter One 2024
Apidays Singapore 2024 - Modernizing Securities Finance by Madhu Subbu
Apidays Singapore 2024 - Modernizing Securities Finance by Madhu Subbu
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Architecting Cloud Native Applications
Architecting Cloud Native Applications
Introductory maths analysis chapter 07 official
1.
INTRODUCTORY MATHEMATICALINTRODUCTORY MATHEMATICAL ANALYSISANALYSISFor
Business, Economics, and the Life and Social Sciences ©2007 Pearson Education Asia Chapter 7Chapter 7 Linear ProgrammingLinear Programming
2.
©2007 Pearson Education
Asia INTRODUCTORY MATHEMATICAL ANALYSIS 0. Review of Algebra 1. Applications and More Algebra 2. Functions and Graphs 3. Lines, Parabolas, and Systems 4. Exponential and Logarithmic Functions 5. Mathematics of Finance 6. Matrix Algebra 7. Linear Programming 8. Introduction to Probability and Statistics
3.
©2007 Pearson Education
Asia 9. Additional Topics in Probability 10. Limits and Continuity 11. Differentiation 12. Additional Differentiation Topics 13. Curve Sketching 14. Integration 15. Methods and Applications of Integration 16. Continuous Random Variables 17. Multivariable Calculus INTRODUCTORY MATHEMATICAL ANALYSIS
4.
©2007 Pearson Education
Asia • To represent geometrically a linear inequality in two variables. • To state a linear programming problem and solve it geometrically. • To consider situations in which a linear programming problem exists. • To introduce the simplex method. • To solve problems using the simplex method. • To introduce use of artificial variables. • To learn alteration of objective function. • To define the dual of a linear programming problem. Chapter 7: Linear Programming Chapter ObjectivesChapter Objectives
5.
©2007 Pearson Education
Asia Linear Inequalities in Two Variables Linear Programming Multiple Optimum Solutions The Simplex Method Degeneracy, Unbounded Solutions, and Multiple Solutio Artificial Variables Minimization The Dual 7.1) 7.2) 7.3) 7.4) Chapter 7: Linear Programming Chapter OutlineChapter Outline 7.5) 7.6) 7.7) 7.8)
6.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.1 Linear Inequalities in 2 Variables7.1 Linear Inequalities in 2 Variables • Linear inequality is written as where a, b, c = constants and not both a and b are zero. 0 or0 or0 or0 ≥++ >++ ≤++ <++ cbyax cbyax cbyax cbyax
7.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.1 Linear Inequalities in 2 Variables • A solid line is included in the solution and a dashed line is not.
8.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.1 Linear Inequalities in 2 Variables Example 1 – Solving a Linear Inequality Example 3 – Solving a System of Linear Inequalities Find the region defined by the inequality y ≤ 5. Solution: The region consists of the line y = 5 and with the half-plane below it. Solve the system Solution: The solution is the unshaded region. −≥ +−≥ 2 102 xy xy
9.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.2 Linear Programming7.2 Linear Programming Example 1 – Solving a Linear Programming Problem • A linear function in x and y has the form • The function to be maximized or minimized is called the objective function. byaxZ += Maximize the objective function Z = 3x + y subject to the constraints 0 0 1232 82 ≥ ≥ ≤+ ≤+ y x yx yx
10.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.2 Linear Programming Example 1 – Solving a Linear Programming Problem Solution: The feasible region is nonempty and bounded. Evaluating Z at these points, we obtain The maximum value of Z occurs when x = 4 and y = 0. ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 4403 11233 12043 0003 =+= =+= =+= =+= DZ CZ BZ AZ
11.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.2 Linear Programming Example 3 – Unbounded Feasible Region The information for a produce is summarized as follows: If the grower wishes to minimize cost while still maintaining the nutrients required, how many bags of each brand should be bought?
12.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.2 Linear Programming Example 3 – Unbounded Feasible Region Solution: Let x = number of bags of Fast Grow bought y = number of bags of Easy Grow bought To minimize the cost function Subject to the constraints There is no maximum value since the feasible region is unbounded . yxC 68 += 0 0 802 20025 16023 ≥ ≥ ≥+ ≥+ ≥+ y x yx yx yx
13.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.3 Multiple Optimum Solutions7.3 Multiple Optimum Solutions Example 1 – Multiple Optimum Solutions • There may be multiple optimum solutions for an objective function. Maximize Z = 2x + 4y subject to the constraints Solution: The region is nonempty and bounded. 0, 162 84 ≥ ≤+ −≤− yx yx yx ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) (max)328402 (max)324482 82402 =+= =+= =+= CZ BZ AZ
14.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.4 The Simplex Method7.4 The Simplex Method Standard Linear Programming Problem • Maximize the linear function subject to the constraints where x and b are non-negative. nn xcxcxcZ +++= 2211 ≤+++ ≤+++ ≤+++ ≤+++ mnmnmm nn nn nn bxaxaxa bxaxaxa bxaxaxa bxaxaxa 2211 11212111 11212111 11212111 . .
15.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.4 The Simplex Method Example 1 – The Simplex Method Maximize subject to and x1, x2 ≥ 0. Solution: The maximum value of Z is 95. ≤+− ≤+ ≤+ 123 352 20 21 21 21 xx xx xx 21 45 xxZ += −− − 0 12 35 20 100045 000013 001012 000111 3 2 1 32121 Z s s s RZsssxxB − − − 95 52 15 5 101300 014500 001101 001210 3 1 2 32121 Z s x x RZsssxxB
16.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.5 Degeneracy, Unbounded and Multiple Solutions7.5 Degeneracy, Unbounded and Multiple Solutions Degeneracy • A basic feasible solution (BFS) is degenerate if one of the basic variables is 0. Unbounded Solutions • An unbounded solution occurs when the objective function has no maximum value. Multiple Optimum Solutions • Multiple (optimum) solutions occur when there are different BFS.
17.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.5 Degeneracy, Unbounded and Multiple Solutions Example 1 – Unbounded Solution Maximize subject to Solution: Since the 1st two rows of the x1-column are negative, no quotients exist. Hence, it has an unbounded solution. 321 4 xxxZ −+= ≥ ≤++− ≤−+− 0,, 1263 30265 321 321 321 xxx xxx xxx 0 12 30 1001-4-1- 010631- 0012-65- Z s s 2 1 32121 RZsssxxB 16 4 6 1090- 0021- 02-114-03- 3 4 3 7 3 1 3 1 2 1 32121 Z x s RZsssxxB
18.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.6 Artificial Variables7.6 Artificial Variables Example 1 – Artificial Variables • Use artificial variables to handle maximization problems that are not of standard form. Maximize subject to Solution: Add an artificial variable t, Consider an artificial objective equation, 212 xxZ += ≥ ≥+− ≤+ ≤+ 0, 2 202 12 21 21 21 21 xx xx xx xx 2 202 12 321 221 121 =+−+− =++ =++ tsxx sxx sxx 02 21 =++−− WMtxx
19.
©2007 Pearson Education
Asia Construct a Simplex Table, All indicators are nonnegative. The maximum value of Z is 17. −−−+− −− MMMMW t s s RWtsssxxB 2100012 20110011 200001021 120000111 2 1 3212` − − 171000 70010 10100 50001 2 1 2 3 2 1 2 1 2 1 2 3 2 1 2 1 2 1 3212` W t s s RZsssxxB Chapter 7: Linear Programming 7.6 Artificial Variables Example 1 – Artificial Variables
20.
©2007 Pearson Education
Asia Use the simplex method to maximize subject to Solution: Construct a Simplex Table, The feasible region is empty, hence, no solution exists. −++− −−− MMMMW s t RWtssxxB 1101021 1001011 1011102 2 1 12121 −−−+− −− MMMMW s t RWtssxxB 210012 1001011 2010111 2 1 12121 Chapter 7: Linear Programming 7.6 Artificial Variables Example 3 – An Empty Feasible Region 2132 xxZ = ≥ ≤+ ≥+− 0, 1 2 21 21 21 xx xx xx
21.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.7 Minimization7.7 Minimization Example 1 – Minimization • To minimize a function is to maximize the negative of the function. Minimize subject to Solution: Construct a Simplex Table, The minimum value of Z is −(−4) = 4. 21 2xxZ += ≥ ≥+− ≥+− 0, 2 12 21 21 21 xx xx xx −−+ − −− MMMMMW t t RWttssxxB 31002231 20101011 10010112 2 1 212121 −+− −−− −− 4122003 10111101 20101011 2 1 212121 MMW t t RWttssxxB
22.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.8 The Dual7.8 The Dual Example 1 – Finding the Dual of a Maximization Problem Find the dual of the following: Maximize subject to where Solution: The dual is minimize subject to where 321 243 xxxZ ++= ≤++ ≤+ 1022 102 321 21 xxx xx 21 1010 yyW += −≥− ≥+− ≥− 34 1 23 21 21 21 xx xx xx 0,, 321 ≥xxx 0, 21 ≥yy
23.
©2007 Pearson Education
Asia Chapter 7: Linear Programming 7.8 The Dual Example 3 – Applying the Simplex Method to the Dual Use the dual and the simplex method to maximize subject to where Solution: The dual is minimize subject to The final Simplex Table is The minimum value of W is 11/2 . 21 24 yyW += 0,, 321 ≥xxx3214 xxxZ −−= ≤++ ≤−+ 2 43 321 321 xxx xxx −≥+− −≥+ ≥+ 1 1 43 21 21 21 yy yy yy − −− −− − − 2 11 2 1 2 3 4 5 4 1 4 1 2 5 2 1 2 1 4 1 4 3 4 1 1 2 2 32121 1000 0001 0100 0010 W y s y RWsssyyB
Download now