Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
17 views2 pages

LPP (Lecture 3)

This document is about lectures delivered on Linear Programming Problem (LPP) (Part -3) at NIT Durgapur

Uploaded by

raju1024manna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
17 views2 pages

LPP (Lecture 3)

This document is about lectures delivered on Linear Programming Problem (LPP) (Part -3) at NIT Durgapur

Uploaded by

raju1024manna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
In txts, where 32,8) 220 Solving System of Linear Equations: ‘The slack variables represent dummy (Fictitious or imaginary) products with zero profit per unit. Here total no. of variables a = 4 and number of constraints m= ‘Using elementary row operations the system (E) can equivalently be written : 2.08 Joe x #24 -% = 300 x: +2s,-5, = 300 “Here system (E), (F),(G) are all equivalent. ‘Hence solving system (G), we get x, = 150, x: 00 “A basic solution can be obtained by setting any of the 2 variables equal te zero and then solving the constraint equations. The total no. of basic solutions wll be 4“ ax x20 “C2 = GBI = Gxt ex 1) me | ae Ne No ~™ | — ©) we | tan Ye vs % . ‘The choice of any two basic variables are purely arbitrary. Here, infact any two variables can be selected as basic variables out of possible 4 variables to obtain @ basic solution, These can be extended to the constraint equations of a standard. linear program with m constraints and variables, the maximum number of basic solutions to the standard linear program is finite and is given by

You might also like