Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
16 views
Linear Programming 2
Part 2 of Linear Programming Summary.
Uploaded by
Faraj Al-Otaibi
AI-enhanced title
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
Download now
Download
Save Linear_Programming_2 For Later
Download
Save
Save Linear_Programming_2 For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
16 views
Linear Programming 2
Part 2 of Linear Programming Summary.
Uploaded by
Faraj Al-Otaibi
AI-enhanced title
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
Download now
Download
Save Linear_Programming_2 For Later
Carousel Previous
Carousel Next
Save
Save Linear_Programming_2 For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 20
Search
Fullscreen
21 Linear Programming 2: Basic Concepts The baste concepts needed to develop the simpler methed for eolving Linear program- ning probleme are presented. PREREQUISITES: Linear Systens Matrices Linear independence Euclidean space 2” Chapter 20: Linear Programing 1 INTRODUCTION In the last chapter we presented a geometric technique for solving linear programing problens in two variables. However, this technique is not practical for the solution of linear programming problems in three or more variables. In this chapter we develop the fundamental ideas behind an algebraic technique, called the si) rethod, for solving linear programing problens in any munber of fariables. The simplex method itself is presented in Chapter 22. ‘The general Linear programming problen inn variables, describ- sd below, is analogous to Problem 20.1 in the last chapter les 303304/ Basic Concerts PROBLEM 24.1 Find values of ay, #y»+++4, vhioh either tegen tag, aye, (S)(2)(4) by Tay, (S1C2)(4) by FG (LZ) By As in Chapter 20, the linear function z in (21.1) is called the ob- dective function’ and conditions (21.2) and (21.3) are called the ‘conetraince of the problem. For our purposes, it is necessary that we first convert our general Linear programming problen to the following etandand form: PROBLEM 24.2 Find valuee of ayy 250+. 2, viich mavinize reggie tee 2.4) ayy aygty tty Dy See 27 ati. us) Sm * Smz*2* Any linear programming problem can always be put in this standard form using the following three steps:Linear Programing 11 / 305 Step 1, Convert a minimization problem to a maximization pro- lon by defining 2 new objective function For example, the problen of minimizing the objective function 2 + Sey Sey is equivalent to the problem of maximizing the objective function 2ey- Sey+ Ses. Stes 2. Convert a > constraint to a < constraint by multiply- ing the inequality by -I- Thus, the constraint “+ 2e, 26 is the same as the constraint Stes 3. Convert a < constraint to an equality constraint by adding @ nonnegative eiaak variable to the 1efthand side of the in- equality. For example, if the original problem contains three var- ables, and one of the constraints is “jo 2+ hrs < -6, we add a new variable «, > 0 to the lefthand side to obtain a7 2eytdagte, = 6. The variable cq takes up the slack between the two sides of the in- equality. In this way, a new yarlable is added to the problem for each < constraint, We assign each slack variable introduced a co- efficient oz =0 in the objective function, so thet the objective function 1s not affected by the values of the Slack variables, EXAMPLE 21.1 convert the following Hnear programing problem to one in standard fort306 / Basic Concerts Subject to 2a + Say - 6 21> Tey Sry 254 > 6 Bay - Bry - Bry + 624 = 5 and Bys os Bye By > 0. SOLUTION te sizse step is to multiply the objective function by =1 to convert the problem to a maximization problen. The second Step is to multiply the second constraint by -1 to convert it to a < inequality. The third step is to add slack variables 25 and 2¢ ¥o the first and second constraints to convert them to equalities. ‘The final problem in standard form is who, + 20, -2, +2, + 0c, + Org subject to and 190 5) Bye Bey Be > 0 It will be convenient to use matrix notation to express Problen 21.2 in 8 more compact fom as follows (the expression X 0 below denotes that each entry of the vector x is nomogative): PROBLEM 21.2 (in matrix notation? Maximize scx subject to andLinear Programming 11 / 307 where or 1 1 42" * Ay 422° xelr | yD ae Hl * 2, " In this formulation, the problem is to find a nonnegative vector x in the vector space R” which satisfies the constraint condition Ax=b and which makes the objective function z= cx as large as possible. Analogous to the terminology in Chapter 20, any nonnege- tive vector x which satisfies the constraint Ax=b is called a feasible solution to the linear programming problem. The set of all feasible solutions in A" is called the feasibie set or the feasible region of the problen. A feasible solution which maximizes the ob- jective function is called an optimal eolwtion. As in Chapter 20, there are three possible outcones to a Linear programming problen: (4). The constraints are inconsistent so that there are no feasible solutions. (i) The feasible set is unbounded and the objective function can be nade arbitrarily large. (id) There is at least one optinal solution. Im most realistic applications only case (iii) arises: Ke nox examine the nature of the feasible set of a linear pré gramming problem. To begin, let us introduce tho following defini- tion: DEFINITION 21.1 4 set of vectors in R” ie called convex 4f whenever x, and x, belong to the set, so does the vee~ tor xe txt = Oxy for any munber t in the interval [0, 1] -308 / Basic Concer Geometrically, the vector x= éxy + (1- #)xp Lies’ on the Line segnent connecting the tips of the vec tors xy and x2 (Fig. 21.1). Thus, a convex sot can be Viewed as one in which the Line segment connect~ ing any two points in the set also belongs to the set. Figures 21.2(a), (®), and (c) illustrate three convex sets in R?. Figure 2j-1(@) is an example of a set in ‘Re which is not convex. In Exer- cise 21.7, we ask the reader to prove the following theorem: THEOREM 21.1 The feasible set of 2 standard Linear programing problen is con thy — %a Keay + 60K - Xp) t+ = 2x, Figure 21.4 Figure 24.2Linear Progranmine TI / 309 ExanpLe 21.2 pox the following Linear programing problen: Maximize = 3r, +2, subject to and the feasible set consists of the portion of the intersection of the two planes (0, 10/3, 20/3) which lies in the first octant of Pieges-space. As we ask the (5/2, 0, 5/5 reader to show in Exercise 21.8, (5/20. 5/2) this intersection consists of the Tine seguent connecting the points = (5/2, 0, 5/2) and (0, 10/3, 20/3) “1 (Fig. 21.5), which is clearly Figure 21.3 ExamPLe 21.3 rox the following Linear progransing problem: Maximize 222, -32)+225 subject to and the feasible set consists of the portion of the plane 2x, + dey Ses = 12310 / Basic Concerts which lies in the first octant of ayozes-space. The reader can easily verify that Fig. 21.4 is a diagram of this feasible set and that it is convex. In Chapter 20, we introduced the concept of an extreme point of a feasible set in xyx2-space. (0,4) For an arbitrary convex set in BT, the corresponding definition is the following: DEFINITION 24.2 A vector x in a conven set to an extreme point of the convex set tf x FOG +x.) Figure 21.4 for any to vestore x, and x, ‘in the vet. In other words, the extreme points of a convex set are those points which do not Lie midway between any two points in the set. For ex- ample, the extrene points of the convex set illustrated in Fig. 21.2 are the two endpoints (5/2, 0, 8/2) and (0, 10/3, 20/3) of the straight-Line segaent, For the convex set illustrated in Fig. 21.4, the extreme points are the three comer points (6.0, 0}, (©, 3, 0), and (0, 0, 4) of the triangular-shaped region. iB Recall that in the last chapter we called a set in 22 bounded if it can be enclosed in a sufficiently large circles that is, if there is sone positive radius 7 such that each point x= (@,,2)) in the set satisfies 3 IIxil-yeteaz
0 For the following linear progranming problen in standard form Maximize subject to and (a) show that the feasible set is bounded, (b) find a11 basic solutions of the linear system Ax=b, (ec) find all basic feasible solutions of the probien, (@ find an optimat solution and the maximum value of the objective function, (e) draw a graph of the basic feasible solutions, as in Fig. 21.5, in which adjacent basic feasible solutions are Linked with a single line. For the following Linear programming problem in standard form: Maximize 22x, - 62, + 325 subject to yt Sy 430522 ny ¢ dey + tug = 3 and (a) find a11 basic solutions of the linear systen Ax=b, (D) show that the problem has no basic feasible solutions. (From this it follows that the feasible set of this problem is eapty.)215 24.6 2aeT 21.8 Linear Progranminé 11 / 321 For the folloving linear programing problen: Maximize 2 5t, ¢22)- 25 subject to and (a) convert the problem to one in standard forn, (b) find ali basic solutions of the Linear system 4) the standard problem, (c) find all basic feasible solutions of the standard problen, (@) find an optimal solution of the standard problem and the maxinur value of the objective function, (0) éray a graph of the basic feasible sofutions of the standard problem, 2s in Fig. 21.5, in which adjacent basic feasible Solutions are linked with a single line. (f) find an optimal solution of the original problem. in Repeat the instructions in Exercise 21.5 for the Linear pro- granning problen: Mininize a= 22, - 32,¢25 subject to and Prove theorem 21.1 as follows: (a) Show that if Ax, «b and Ax, «by X= 0x, + (1- #)x, for any # in the interval [0, 1]. (©) Show that if x20 and xp20) then x20 58 x= tx, + (1- 9x, for any t in the interval [0,1] jen Ax=b if Show that the feasible set of the linear programming problen in Example 21.2 is the set illustrated in Fig. 21.5.322 / Basic Concerts 24.9 Show that the feasible set of the linear programming problem in Example 21.5 is bounded. Proceed as follows: (a) From the constraint de, t+ dey Qe, = 20 and the nonnegativity conditions 2;>0 (i= glude that =; <20 for i= 1,3,4,5 12,3,4,5) com (b) Add the two constraints together and conclude that 2, < 50, Ce) Fron (a) and (6), conchuie that [fx] < » for sone positive 24.40 Show that the linear system (21.7) can be written in the vee- tor form (21.8).
You might also like
Isye 6669 Midterm I: Instructor: Prof. Shabbir Ahmed and Prof. Andy Sun
PDF
No ratings yet
Isye 6669 Midterm I: Instructor: Prof. Shabbir Ahmed and Prof. Andy Sun
10 pages
HW2 Sol
PDF
No ratings yet
HW2 Sol
5 pages
Linear Programming
PDF
No ratings yet
Linear Programming
88 pages
Linear Programming Problems
PDF
No ratings yet
Linear Programming Problems
37 pages
Linear Programming Notes
PDF
No ratings yet
Linear Programming Notes
24 pages
lp
PDF
No ratings yet
lp
12 pages
Solu 10
PDF
No ratings yet
Solu 10
43 pages
Solu 10
PDF
No ratings yet
Solu 10
43 pages
5 Solutions of Linear Programs
PDF
No ratings yet
5 Solutions of Linear Programs
4 pages
Lecture Note
PDF
No ratings yet
Lecture Note
284 pages
Math484 V1 PDF
PDF
No ratings yet
Math484 V1 PDF
167 pages
Linear Programming: Penn State Math 484 Lecture Notes: Licensed Under A
PDF
No ratings yet
Linear Programming: Penn State Math 484 Lecture Notes: Licensed Under A
167 pages
Linear Programming Notes
PDF
No ratings yet
Linear Programming Notes
169 pages
Linear Programming
PDF
No ratings yet
Linear Programming
71 pages
Maths Xii Chapter 12 Linear Programming
PDF
No ratings yet
Maths Xii Chapter 12 Linear Programming
39 pages
Notes On Linear Programming: CE 377K Stephen D. Boyles Spring 2015
PDF
No ratings yet
Notes On Linear Programming: CE 377K Stephen D. Boyles Spring 2015
17 pages
Kelompok 2 - Linear Programming (English)
PDF
No ratings yet
Kelompok 2 - Linear Programming (English)
37 pages
Chapter-5.-Linear-Programming
PDF
No ratings yet
Chapter-5.-Linear-Programming
21 pages
LP Methods (Notes)
PDF
No ratings yet
LP Methods (Notes)
32 pages
Mathematics Notes and Formula For Class 12 Chapter 12. Linear Programming PDF
PDF
No ratings yet
Mathematics Notes and Formula For Class 12 Chapter 12. Linear Programming PDF
7 pages
03 Linear Programming
PDF
No ratings yet
03 Linear Programming
55 pages
LPP Gate
PDF
No ratings yet
LPP Gate
44 pages
Business Maths Chapter 4
PDF
No ratings yet
Business Maths Chapter 4
23 pages
Optimization (SF1811 SF1831 SF1841)
PDF
No ratings yet
Optimization (SF1811 SF1831 SF1841)
198 pages
Chapter 8 - Linear Programming
PDF
No ratings yet
Chapter 8 - Linear Programming
163 pages
Güler2010 Chapter LinearProgramming
PDF
No ratings yet
Güler2010 Chapter LinearProgramming
13 pages
Linear Programming MSM 2da (G05a, M09a) : Matthias Gerdts
PDF
No ratings yet
Linear Programming MSM 2da (G05a, M09a) : Matthias Gerdts
85 pages
04 - Matrices (III) and LP
PDF
No ratings yet
04 - Matrices (III) and LP
43 pages
Linier Programming (I)
PDF
No ratings yet
Linier Programming (I)
33 pages
LP
PDF
No ratings yet
LP
49 pages
Exam 1 Rev
PDF
No ratings yet
Exam 1 Rev
4 pages
9-Optimization and Simplex
PDF
No ratings yet
9-Optimization and Simplex
16 pages
Maths CDF Points
PDF
No ratings yet
Maths CDF Points
1 page
Frank 1956
PDF
No ratings yet
Frank 1956
16 pages
Linear Programming 1
PDF
No ratings yet
Linear Programming 1
17 pages
B For I 1,, M: N J J J
PDF
No ratings yet
B For I 1,, M: N J J J
19 pages
FM PPT Ch07
PDF
No ratings yet
FM PPT Ch07
40 pages
Isye 6669 Midterm Practice: Instructors: Prof. Andy Sun
PDF
No ratings yet
Isye 6669 Midterm Practice: Instructors: Prof. Andy Sun
10 pages
Homework 2
PDF
No ratings yet
Homework 2
4 pages
Chapter 2
PDF
No ratings yet
Chapter 2
28 pages
Linear Programming Notes
PDF
No ratings yet
Linear Programming Notes
168 pages
Linear Programming
PDF
No ratings yet
Linear Programming
10 pages
NLP 2016 Intro
PDF
No ratings yet
NLP 2016 Intro
36 pages
Operations Research
PDF
No ratings yet
Operations Research
19 pages
Introduction LP Duality1 PDF
PDF
No ratings yet
Introduction LP Duality1 PDF
29 pages
Wisdom of Crowds Intro
PDF
No ratings yet
Wisdom of Crowds Intro
53 pages
Lecture 2
PDF
No ratings yet
Lecture 2
22 pages
LPP INTRODUCTION DEFINITIONAND EXAMPLES OF Linear Programming Intro
PDF
No ratings yet
LPP INTRODUCTION DEFINITIONAND EXAMPLES OF Linear Programming Intro
18 pages
LPP
PDF
No ratings yet
LPP
7 pages
Graphical method
PDF
No ratings yet
Graphical method
6 pages
Lec 05 - Week 05 Operations Research
PDF
No ratings yet
Lec 05 - Week 05 Operations Research
33 pages
INDE 513 hw1 Sol
PDF
No ratings yet
INDE 513 hw1 Sol
7 pages
Linear Programming - PLPN MhtCet
PDF
No ratings yet
Linear Programming - PLPN MhtCet
32 pages
Operation Research B.SC 6 Sem
PDF
No ratings yet
Operation Research B.SC 6 Sem
44 pages
Linear Programming Is The Simplest Way of Optimizing A Problem
PDF
No ratings yet
Linear Programming Is The Simplest Way of Optimizing A Problem
13 pages
Linear Programing Notes
PDF
No ratings yet
Linear Programing Notes
7 pages
Optimization and Linear Programming 1
PDF
No ratings yet
Optimization and Linear Programming 1
34 pages
Math 5610 Fall 2018 Notes of 09/25-26/18 Linear Programming
PDF
No ratings yet
Math 5610 Fall 2018 Notes of 09/25-26/18 Linear Programming
14 pages
Related titles
Click to expand Related Titles
Carousel Previous
Carousel Next
Isye 6669 Midterm I: Instructor: Prof. Shabbir Ahmed and Prof. Andy Sun
PDF
Isye 6669 Midterm I: Instructor: Prof. Shabbir Ahmed and Prof. Andy Sun
HW2 Sol
PDF
HW2 Sol
Linear Programming
PDF
Linear Programming
Linear Programming Problems
PDF
Linear Programming Problems
Linear Programming Notes
PDF
Linear Programming Notes
lp
PDF
lp
Solu 10
PDF
Solu 10
Solu 10
PDF
Solu 10
5 Solutions of Linear Programs
PDF
5 Solutions of Linear Programs
Lecture Note
PDF
Lecture Note
Math484 V1 PDF
PDF
Math484 V1 PDF
Linear Programming: Penn State Math 484 Lecture Notes: Licensed Under A
PDF
Linear Programming: Penn State Math 484 Lecture Notes: Licensed Under A
Linear Programming Notes
PDF
Linear Programming Notes
Linear Programming
PDF
Linear Programming
Maths Xii Chapter 12 Linear Programming
PDF
Maths Xii Chapter 12 Linear Programming
Notes On Linear Programming: CE 377K Stephen D. Boyles Spring 2015
PDF
Notes On Linear Programming: CE 377K Stephen D. Boyles Spring 2015
Kelompok 2 - Linear Programming (English)
PDF
Kelompok 2 - Linear Programming (English)
Chapter-5.-Linear-Programming
PDF
Chapter-5.-Linear-Programming
LP Methods (Notes)
PDF
LP Methods (Notes)
Mathematics Notes and Formula For Class 12 Chapter 12. Linear Programming PDF
PDF
Mathematics Notes and Formula For Class 12 Chapter 12. Linear Programming PDF
03 Linear Programming
PDF
03 Linear Programming
LPP Gate
PDF
LPP Gate
Business Maths Chapter 4
PDF
Business Maths Chapter 4
Optimization (SF1811 SF1831 SF1841)
PDF
Optimization (SF1811 SF1831 SF1841)
Chapter 8 - Linear Programming
PDF
Chapter 8 - Linear Programming
Güler2010 Chapter LinearProgramming
PDF
Güler2010 Chapter LinearProgramming
Linear Programming MSM 2da (G05a, M09a) : Matthias Gerdts
PDF
Linear Programming MSM 2da (G05a, M09a) : Matthias Gerdts
04 - Matrices (III) and LP
PDF
04 - Matrices (III) and LP
Linier Programming (I)
PDF
Linier Programming (I)
LP
PDF
LP
Exam 1 Rev
PDF
Exam 1 Rev
9-Optimization and Simplex
PDF
9-Optimization and Simplex
Maths CDF Points
PDF
Maths CDF Points
Frank 1956
PDF
Frank 1956
Linear Programming 1
PDF
Linear Programming 1
B For I 1,, M: N J J J
PDF
B For I 1,, M: N J J J
FM PPT Ch07
PDF
FM PPT Ch07
Isye 6669 Midterm Practice: Instructors: Prof. Andy Sun
PDF
Isye 6669 Midterm Practice: Instructors: Prof. Andy Sun
Homework 2
PDF
Homework 2
Chapter 2
PDF
Chapter 2
Linear Programming Notes
PDF
Linear Programming Notes
Linear Programming
PDF
Linear Programming
NLP 2016 Intro
PDF
NLP 2016 Intro
Operations Research
PDF
Operations Research
Introduction LP Duality1 PDF
PDF
Introduction LP Duality1 PDF
Wisdom of Crowds Intro
PDF
Wisdom of Crowds Intro
Lecture 2
PDF
Lecture 2
LPP INTRODUCTION DEFINITIONAND EXAMPLES OF Linear Programming Intro
PDF
LPP INTRODUCTION DEFINITIONAND EXAMPLES OF Linear Programming Intro
LPP
PDF
LPP
Graphical method
PDF
Graphical method
Lec 05 - Week 05 Operations Research
PDF
Lec 05 - Week 05 Operations Research
INDE 513 hw1 Sol
PDF
INDE 513 hw1 Sol
Linear Programming - PLPN MhtCet
PDF
Linear Programming - PLPN MhtCet
Operation Research B.SC 6 Sem
PDF
Operation Research B.SC 6 Sem
Linear Programming Is The Simplest Way of Optimizing A Problem
PDF
Linear Programming Is The Simplest Way of Optimizing A Problem
Linear Programing Notes
PDF
Linear Programing Notes
Optimization and Linear Programming 1
PDF
Optimization and Linear Programming 1
Math 5610 Fall 2018 Notes of 09/25-26/18 Linear Programming
PDF
Math 5610 Fall 2018 Notes of 09/25-26/18 Linear Programming