# 01-LINEAR PROGRAMMING (THEORY)

STUDY INNOVATIONSEducator à Study Innovations

‘Linear Programming’ is a scientific tool to handle optimization problems. Here, we shall learn about some basic concepts of linear programming problems in two variables, their applications, advantages, limitations, formulation and graphical method of solution. 6.1 Linear Inequations . (1) Graph of linear inequations (i) Linear inequation in one variable : etc. are called linear inequations in one variable. Graph of these inequations can be drawn as follows : The graph of and are obtained by dividing xy-plane in two semi-planes by the line (which is parallel to y-axis). Similarly for and . (ii) Linear Inequation in two variables : General form of these inequations are . If any ordered pair satisfies some inequations, then it is said to be a solution of the inequations. The graph of these inequations is given below (for c > 0) : Working rule To draw the graph of an inequation, following procedure is followed : (i) Write the equation in place of and . (ii) Make a table for the solutions of . (iii) Now draw a line with the help of these points. This is the graph of the line . (iv) If the inequation is > or <, then the points lying on this line is not considered and line is drawn dotted or discontinuous. (v) If the ineuqation is > or <, then the points lying on the line is considered and line is drawn bold or continuous. (vi) This line divides the plane XOY in two region. To Find the region that satisfies the inequation, we apply the following rules: (a) Take an arbitrary point which will be in either region. (b) If it satisfies the given inequation, then the required region will be the region in which the arbitrary point is located. (c) If it does not satisfy the inequation, then the other region is the required region. (d) Draw the lines in the required region or make it shaded. (2) Simultaneous linear inequations in two variables : Since the solution set of a system of simultaneous linear inequations is the set of all points in two dimensional space which satisfy all the inequations simultaneously. Therefore to find the solution set we find the region of the plane common to all the portions comprising the solution set of given inequations. In case there is no region common to all the solutions of the given inequations, we say that the solution set is void or empty. (3) Feasible region : The limited (bounded) region of the graph made by two inequations is called feasible region. All the points in feasible region constitute the solution of a system of inequations. The feasible solution of a L.P.P. belongs to only first quadrant. If feasible region is empty then there is no solution for the problem. Example: 1 Inequations and (a) Have solution for positive x and y (b) Have no solution for positive x and y (c) Have solution for all x (d) Have solution for all y Solution : (a) Following figure will be obtained on drawing the graphs of given inequations : From From Clearly the comm

## Recommandé

Linear Programming (Theory & Exercise) Module-6-B.pdf par
Linear Programming (Theory & Exercise) Module-6-B.pdfSTUDY INNOVATIONS
8 vues10 diapositives
Graphically find all optimal solutions to the following LP- min z x1 x.docx par
Graphically find all optimal solutions to the following LP- min z x1 x.docxdelicecogupdyke
11 vues2 diapositives
OI.ppt par
OI.pptraj20072
8 vues49 diapositives
Sbmp 4203 linear programming par
Sbmp 4203 linear programmingSaidatina Khadijah
236 vues17 diapositives
Lecture 07 graphing linear equations par
Lecture 07 graphing linear equationsHazel Joy Chong
1.1K vues15 diapositives
Chapter 04 par
Chapter 04ernestomuozorenday
610 vues93 diapositives

## Similaire à 01-LINEAR PROGRAMMING (THEORY)

Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi... par
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...SSA KPI
526 vues32 diapositives
Numerical Solution to Ninth order Non- Linear Differential Equation Using the... par
Numerical Solution to Ninth order Non- Linear Differential Equation Using the...rahulmonikasharma
110 vues3 diapositives
CMR_Graphical Method -Special cases.pdf par
CMR_Graphical Method -Special cases.pdfKhaderMohamet
11 vues23 diapositives
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona... par
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...MangaiK4
3 vues6 diapositives
Non-Linear Fractional Programming Problems par
Non-Linear Fractional Programming ProblemsMangaiK4
19 vues6 diapositives
Linear programming: A Geometric Approach par
Linear programming: A Geometric ApproachEFREN ARCHIDE
468 vues22 diapositives

### Similaire à 01-LINEAR PROGRAMMING (THEORY)(20)

Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi... par SSA KPI
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...
SSA KPI526 vues
Numerical Solution to Ninth order Non- Linear Differential Equation Using the... par rahulmonikasharma
Numerical Solution to Ninth order Non- Linear Differential Equation Using the...
CMR_Graphical Method -Special cases.pdf par KhaderMohamet
CMR_Graphical Method -Special cases.pdf
KhaderMohamet11 vues
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona... par MangaiK4
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...
MangaiK43 vues
Non-Linear Fractional Programming Problems par MangaiK4
Non-Linear Fractional Programming Problems
MangaiK419 vues
Linear programming: A Geometric Approach par EFREN ARCHIDE
Linear programming: A Geometric Approach
EFREN ARCHIDE468 vues
CSCI 2033 Elementary Computational Linear Algebra(Spring 20.docx par mydrynan
CSCI 2033 Elementary Computational Linear Algebra(Spring 20.docx
mydrynan5 vues
A Linear Assignment Formulation Of The Multiattribute Decision Problem par Wendy Berg
A Linear Assignment Formulation Of The Multiattribute Decision Problem
Wendy Berg2 vues
5HBC: How to Graph Implicit Relations Intro Packet! par A Jorge Garcia
5HBC: How to Graph Implicit Relations Intro Packet!
A Jorge Garcia1.8K vues
A Simplex-Cosine Method For Solving Hard Linear Problems par Bryce Nelson
A Simplex-Cosine Method For Solving Hard Linear Problems
Bryce Nelson2 vues
Numerical analysis using Scilab: Solving nonlinear equations par Scilab
Numerical analysis using Scilab: Solving nonlinear equations
Scilab9.5K vues
linear equation in two variable.pptx par KirtiChauhan62
linear equation in two variable.pptx
KirtiChauhan6223 vues
Determination of Optimal Product Mix for Profit Maximization using Linear Pro... par IJERA Editor
Determination of Optimal Product Mix for Profit Maximization using Linear Pro...
IJERA Editor108 vues
Determination of Optimal Product Mix for Profit Maximization using Linear Pro... par IJERA Editor
Determination of Optimal Product Mix for Profit Maximization using Linear Pro...
IJERA Editor328 vues

## Plus de STUDY INNOVATIONS

Chemistry-40.One Year CRP-Test Paper-6-Solutions par
Chemistry-40.One Year CRP-Test Paper-6-SolutionsSTUDY INNOVATIONS
0 vue2 diapositives
Chemistry-38.Test Paper-12 Studying Merg 27 par
Chemistry-38.Test Paper-12 Studying Merg 27STUDY INNOVATIONS
0 vue11 diapositives
Chemistry-11.Test Paper-CRP-XII Studying-3-Screening par
Chemistry-11.Test Paper-CRP-XII Studying-3-ScreeningSTUDY INNOVATIONS
0 vue3 diapositives
Chemistry-23.Transition Element-Theory par
Chemistry-23.Transition Element-TheorySTUDY INNOVATIONS
0 vue37 diapositives
Chemistry-22.Solid State-Theory par
Chemistry-22.Solid State-TheorySTUDY INNOVATIONS
0 vue28 diapositives
Chemistry-21.Qualitative Analysis-Theory par
Chemistry-21.Qualitative Analysis-TheorySTUDY INNOVATIONS
0 vue40 diapositives

## Dernier

MIXING OF PHARMACEUTICALS.pptx par
MIXING OF PHARMACEUTICALS.pptxAnupkumar Sharma
107 vues35 diapositives
STRATEGIC MANAGEMENT MODULE 1_UNIT1 _UNIT2.pdf par
STRATEGIC MANAGEMENT MODULE 1_UNIT1 _UNIT2.pdfDr Vijay Vishwakarma
87 vues68 diapositives
EILO EXCURSION PROGRAMME 2023 par
EILO EXCURSION PROGRAMME 2023info33492
124 vues40 diapositives
CUNY IT Picciano.pptx par
CUNY IT Picciano.pptxapicciano
56 vues17 diapositives
Pharmaceutical Inorganic Chemistry Unit IVMiscellaneous compounds Expectorant... par
Pharmaceutical Inorganic Chemistry Unit IVMiscellaneous compounds Expectorant...Ms. Pooja Bhandare
166 vues45 diapositives
SURGICAL MANAGEMENT OF CERVICAL CANCER DR. NN CHAVAN 28102023.pptx par
SURGICAL MANAGEMENT OF CERVICAL CANCER DR. NN CHAVAN 28102023.pptxNiranjan Chavan
43 vues54 diapositives

### Dernier(20)

EILO EXCURSION PROGRAMME 2023 par info33492
EILO EXCURSION PROGRAMME 2023
info33492124 vues
CUNY IT Picciano.pptx par apicciano
CUNY IT Picciano.pptx
apicciano56 vues
Pharmaceutical Inorganic Chemistry Unit IVMiscellaneous compounds Expectorant... par Ms. Pooja Bhandare
Pharmaceutical Inorganic Chemistry Unit IVMiscellaneous compounds Expectorant...
SURGICAL MANAGEMENT OF CERVICAL CANCER DR. NN CHAVAN 28102023.pptx par Niranjan Chavan
SURGICAL MANAGEMENT OF CERVICAL CANCER DR. NN CHAVAN 28102023.pptx
Niranjan Chavan43 vues
INT-244 Topic 6b Confucianism par S Meyer
INT-244 Topic 6b Confucianism
S Meyer44 vues
Monthly Information Session for MV Asterix (November) par Esquimalt MFRC
Monthly Information Session for MV Asterix (November)
Esquimalt MFRC91 vues
NodeJS and ExpressJS.pdf par ArthyR3
NodeJS and ExpressJS.pdf
ArthyR346 vues
Parts of Speech (1).pptx par mhkpreet001
Parts of Speech (1).pptx
mhkpreet00143 vues
Creative Restart 2023: Leonard Savage - The Permanent Brief: Unearthing unobv... par Taste
Creative Restart 2023: Leonard Savage - The Permanent Brief: Unearthing unobv...
Taste50 vues
Creative Restart 2023: Atila Martins - Craft: A Necessity, Not a Choice par Taste
Creative Restart 2023: Atila Martins - Craft: A Necessity, Not a Choice
Taste38 vues
12.5.23 Poverty and Precarity.pptx par mary850239
12.5.23 Poverty and Precarity.pptx
mary850239123 vues
Create a Structure in VBNet.pptx par Breach_P
Create a Structure in VBNet.pptx
Breach_P80 vues
Class 9 lesson plans par TARIQ KHAN
Class 9 lesson plans
TARIQ KHAN53 vues
Education of marginalized and socially disadvantages segments.pptx par GarimaBhati5
Education of marginalized and socially disadvantages segments.pptx
GarimaBhati539 vues

### 01-LINEAR PROGRAMMING (THEORY)

• 1. 174 Linear Programming ‘Linear Programming’ is a scientific tool to handle optimization problems. Here, we shall learn about some basic concepts of linear programming problems in two variables, their applications, advantages, limitations, formulation and graphical method of solution. 6.1 Linear Inequations . (1) Graph of linear inequations (i) Linear inequation in one variable : 0 , 0 , 0       d cy b ax b ax etc. are called linear inequations in one variable. Graph of these inequations can be drawn as follows : The graph of 0   b ax and 0   b ax are obtained by dividing xy-plane in two semi-planes by the line a b x   (which is parallel to y-axis). Similarly for 0   d cy and 0   d cy . (ii) Linear Inequation in two variables : General form of these inequations are c by ax c by ax     , . If any ordered pair   1 1 ,y x satisfies some inequations, then it is said to be a solution of the inequations. The graph of these inequations is given below (for c > 0) : Working rule To draw the graph of an inequation, following procedure is followed : (i) Write the equation c by ax   in place of c by ax   and c by ax   . a b x   ax+b>0 Y Y X X ax+b<0 O Y Y X X c d y   cy+d>0 cy+d<0 Y Y X X ax+by<c ax+by=c ax+by>c O 174
• 2. Linear Programming 175 (ii) Make a table for the solutions of c by ax   . (iii) Now draw a line with the help of these points. This is the graph of the line c by ax   . (iv) If the inequation is > or <, then the points lying on this line is not considered and line is drawn dotted or discontinuous. (v) If the ineuqation is > or <, then the points lying on the line is considered and line is drawn bold or continuous. (vi) This line divides the plane XOY in two region. To Find the region that satisfies the inequation, we apply the following rules: (a) Take an arbitrary point which will be in either region. (b)Ifitsatisfies thegiven inequation,thentherequiredregion willbethe region inwhichthearbitrarypointis located. (c) If it does not satisfy the inequation, then the other region is the required region. (d) Draw the lines in the required region or make it shaded. (2) Simultaneous linear inequations in two variables : Since the solution set of a system of simultaneous linear inequations is the set of all points in two dimensional space which satisfy all the inequations simultaneously. Therefore to find the solution set we find the region of the plane common to all the portions comprising the solution set of given inequations. In case there is no region common to all the solutions of the given inequations, we say that the solution set is void or empty. (3) Feasible region : The limited (bounded) region of the graph made by two inequations is called feasible region. All the points in feasible region constitute the solution of a system of inequations. The feasible solution of a L.P.P. belongs to only first quadrant. If feasible region is empty then there is no solution for the problem. Example: 1 Inequations 3 3   y x and 4 4   y x (a) Have solution for positive x and y (b) Have no solution for positive x and y (c) Have solution for all x (d) Have solution for all y Solution : (a) Following figure will be obtained on drawing the graphs of given inequations : From 1 3 1 , 3 3      y x y x From 1 4 1 , 4 4      y x y x Clearly the common region of both the inequations is true for positive value of (x, y). It is also true for positive values of xand negative values of y. Example: 2 The constraints [MP PET 1999] – 1 2 1    x x ; – 9 3 2 1   x x ; 0 , 2  x x define (a) Bounded feasible space (b) Unbounded feasible space (c) Both bounded and unbounded feasible space (d) None of these Solution : (b) It is clear from the graph, the constraints define an unbounded feasible space. Example: 3 Shaded region is represented by O (1,0) (0,–3) (0,–4) Y X (–9,0) O (0,1) (3,4) (–1,0) x1 x2 (0,3)
• 3. 176 Linear Programming (a) 0 , 0 , 20 , 80 5 2       y x y x y x (b) 0 , 0 , 20 , 80 5 2       y x y x y x (c) 0 , 0 , 20 , 80 5 2       y x y x y x (d) 0 , 0 , 20 , 80 5 2       y x y x y x Solution: (c) In all the given equations, the origin is present in shaded area. Answer (c) satisfy this condition. Example: 4 Shaded region is represented by (a) 3 2 4   y x (b) 3 2 4    y x (c) 3 2 4   y x (d) 3 2 4    y x Solution: (b) Origin is not present in given shaded area. So 3 2 4    y x satisfy this condition. 6.2 Terms of Linear Programming . The term programming means planning and refers to a process of determining a particular program. (1) Objective function : The linear function which is to be optimized (maximized or minimized) is called objective function of the L.P.P. (2) Constraints or Restrictions : The conditions of the problem expressed as simultaneous equations or inequalities are called constraints or restrictions. (3) Non-negative Constraints : Variables applied in the objective function of a linear programming problem are always non-negative. The ineqaulities which represent such constraints are called non-negative constraints. (4) Basic variables : The m variables associated with columns of the m × n non-singular matrix which may be different from zero, are called basic variables. (5) Basic solution : A solution in which the vectors associated to m variables are linear and the remaining ) ( m n  variables are zero, is called a basic solution. A basic solution is called a degenerate basic solution, if at least one of the basic variables is zero and basic solution is called non-degenerate, if none of the basic variables is zero. (6) Feasible solution : The set of values of the variables which satisfies the set of constraints of linear programming problem (L.P.P) is called a feasible solution of the L.P.P. (7) Optimal solution : A feasible solution for which the objective function is minimum or maximum is called optimal solution. (8) Iso-profit line : The line drawn in geometrical area of feasible region of L.P.P. for which the objective function remains constant at all the points lying on the line, is called iso-profit line.        0 , 4 3 B Shaded region A(0,3/2) 4x–2y=–3 y x O       3 40 , 3 20 B Shaded region O A(20,0) x (40,0) 2x+5y=80 x+y=20 y C(0,16) (0,20) Y X
• 4. Linear Programming 177 If the objective function is to be minimized then these lines are called iso-cost lines. (9) Convex set : In linear programming problems feasible solution is generally a polygon in first quadrant . This polygon is convex. It means if two points of polygon are connecting by a line, then the line must be inside to polygon. For example, Figure (i) and (ii) are convex set while (iii) and (iv) are not convex set 6.3 Mathemiatical formulation of a Linear programming problem . There are mainly four steps in the mathematical formulation of a linear programming problem, as mathematical model. We will discuss formulation of those problems which involve only two variables. (1) Identify the decision variables and assign symbols x and y to them. These decision variables are those quantities whose values we wish to determine. (2) Identify the set of constraints and express them as linear equations/inequations in terms of the decision variables. These constraints are the given conditions. (3) Identify the objective function and express it as a linear function of decision variables. It might take the form of maximizing profit or production or minimizing cost. (4) Add the non-negativity restrictions on the decision variables, as in the physical problems, negative values of decision variables have no valid interpretation. 6.4 Graphical solution of two variable Linear programming problem . There are two techniques of solving an L.P.P. by graphical method. These are : (1) Corner point method, and (2) Iso-profit or Iso-cost method. (1) Corner point method Working rule (i) Formulate mathematically the L.P.P. (ii) Draw graph for every constraint. (iii) Find the feasible solution region. (iv) Find the coordinates of the vertices of feasible solution region. (v) Calculate the value of objective function at these vertices. (vi) Optimal value (minimum or maximum) is the required solution. Note :  If there is no possibility to determine the point at which the suitable solution found, then the solution of problem is unbounded.  If feasible region is empty, then there is no solution for the problem.  Nearer to the origin, the objective function is minimum and that of further from the origin, the objective function is maximum. (2) Iso-profit or Iso-cost method : Various steps of the method are as follows : (i) Find the feasible region of the L.P.P. (ii) Assign a constant value Z1 to Z and draw the corresponding line of the objective function. (iii) Assign another value Z2 to Z and draw the corresponding line of the objective function. (i) (ii) (iv A B (iii A B
• 5. 178 Linear Programming (iv) If ) ( , 2 1 2 1 Z Z Z Z   , then in case of maximization (minimization) move the line P1Q1 corresponding to Z1 to the line P2Q2 corresponding to Z2 parallel to itself as far as possible, until the farthest point within the feasible region is touched by this line. The coordinates of the point give maximum (minimum) value of the objectivefunction. Note :  The problem with more equations/inequations can be handled easily by this method.  In case of unbounded region, it either finds an optimal solution or declares an unbounded solution. Unbounded solutions are not considered optimal solution. In real world problems, unlimited profit or loss is not possible. 6.5 To find the Vertices of Simple feasible region without Drawing a Graph . (1) Bounded region: The region surrounded by the inequalities m by ax   and n dy cx   in first quadrant is called bounded region. It is of the form of triangle or quadrilateral. Change these inequalities into equation, then by putting 0  x and , 0  y we get the solution also by solving the equation in which there may be the vertices of bounded region. The maximum value of objective function lies at one vertex in limited region. (2) Unbounded region : The region surrounded by the inequations m by ax   and n dy cx   in first quadrant, is called unbounded region. Change the inequation in equations and solve for 0  x and 0  y . Thus we get the vertices of feasible region. The minimum value of objective function lies at one vertex in unbounded region but there is no existence of maximum value. 6.6 Problems having Infeasible Solutions. In some of the linear programming problems, constraints are inconsistent i.e. there does not exist any point which satisfies all the constraints. Such type of linear programming problems are said to have infeasible solution. For Example : Maximize y x Z 2 5   subject to the constraints 2   y x , 2 3 3   y x , 0 ,  y x The above problem is illustrated graphically in the fig. There is no point satisfying the set of above constraints. Thus, the problem is having an infeasible solution. 6.7 Some important points about L.P.P.. (1) If the constraints in a linear programming problem are changed, the problem is to be re-evaluated. (2) The optimal value of the objective function is attained at the point, given by corner points of the feasible region. (3) If a L.P.P. admits two optimal solutions, it has an infinite number of optimal solutions. (4) If there is no possibility to determine the point at which the suitable solution can be found, then the solution of problem is unbounded. (5) The maximum value of objective function lies at one vertex in limited region. Example: 5 A firm makes pants and shirt. A shirt takes 2 hour on machine and 3 hour of man labour while a pant takes 3 hour on machine and 2 hour of man labour. In a week there are 70 hour of machine and 75 hour of man labour available. If the firm determines to make x shirts and y pants per week, then for this the linear constraints are (a) 75 2 3 , 70 3 2 , 0 , 0       y x y x y x (b) 75 2 3 , 70 3 2 , 0 , 0       y x y x y x (c) 75 2 3 , 70 3 2 , 0 , 0        y x y x y x (d) 75 2 3 , 70 3 2 , 0 , 0       y x y x y x Solution: (d) 1 10 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 10
• 6. Linear Programming 179 Working time on machine Man labour Shirt (x) 2 hours 3 hours Pant (y) 3 hours 2 hours Availability 70 hours 75 hours Linear constraints are 75 2 3 , 70 3 2     y x y x and 0 ,  y x Example: 6 The minimum value of the objective function y x Z 10 2   for linear constraints 5 5 , 0      y x y x and 0 ,  y x is (a) 10 (b) 15 (c) 12 (d) 8 Solution: (b) Required region is unbounded whose vertex is       4 5 , 4 5 Hence the minimum value of objective function is 15 4 5 10 4 5 2      . Example: 7 Minimize     n j m i ij ijx c z 1 1 Subject to : m i a x i n j ij ........, 1 , 1     ;     m i j ij n j b x 1 ......, 1 , is a LPP with number of constraints (a) n m  (b) n m  (c) mn (d) n m Solution: (a) (I) Condition, 1 1 13 12 11 . .......... , 1 a x x x x i n       2 2 23 22 21 . .......... , 2 a x x x x i n       3 3 33 32 31 .. .......... , 3 a x x x x i n       ................................... s constraint . .......... , 3 2 1 m a x x x x m i m mn m m m        (II) Condition 1 1 31 21 11 .......... , 1 b x x x x j m       2 2 32 22 12 . .......... , 2 b x x x x j m       .................................... n b x x x x n j n mn n n n        .... .......... , 3 2 1 constraints  Total constraints n m   . Example: 8 Maximize , 2 3 y x z   subject to 3 , 6 , 1 , 0 5 , 1           x y x y x x y y x and 0 ,  y x (a) 3  x (b) 3  y (c) 15  z (d) All the above Solution: (d) The shaded region represents the bounded region (3,3) satisfies, so 3 , 3   y x and 15  z . Example: 9 Maximum value of y x 5 4  subject to the constraints 12 3 , 35 2 , 20       y x y x y x is (a) 84 (b) 95 (c) 100 (d) 96 Solution: (b) Obviously, max. 95 5 4   y x . It is at (5, 15). y – 5x=0 x – y = –1 (5/2, 7/2) (3,3) x + y = 6 x=3 (0,1) (1,0) x – y=0 x – 5y = –5 O X Y (5,15) (18,2) x – 3y = 12 x + 2y = 35 (12,0)(20,0) (35,0) (0,20)       2 1 17 , 0
• 7. 180 Linear Programming Example: 10 The maximum value of y x Z 3 4   subjected to the constraints , 160 2 3   y x 0 , , 80 2 , 200 2 5      y x y x y x is (a) 320 (b) 300 (c) 230 (d) None of these Solution: (d) Obviously, it is unbounded. Therefore its maximum value does not exist. Example: 11 The objective function y x Z 3 4   can be maximized subjected to the constraints 0 , ; 6 , 5 , 48 6 8 , 24 4 3        y x y x y x y x (a) Atonlyonepoint (b) Attwopointsonly (c) Ataninfinitenumberofpoints(d)None of these Solution: (c) Obviously, the optimal solution is found on the line which is parallel to 'isoprofit line'. Hence it has infinite number of solutions. Example: 12 The maximum value of y x µ 4 3   subjected to the conditions 0 , ; 60 2 , 40      y x y x y x is [MP PET 2002,04 ] (a) 130 (b) 120 (c) 40 (d) 140 Solution: (d) Obviously Max ) 20 , 20 ( at 4 3 y x µ   140 80 60    µ . 6.8 Advantages and Limitations of L.P.P.. (1) Advantages : Linear programming is used to minimize the cost of production for maximum output. In short, with the help of linear programming models, a decision maker can most efficiently and effectively employ his production factor and limited resources to get maximum profit at minimum cost. (2) Limitations : (i) The linear programming can be applied only when the objective function and all the constraints can be expressed in terms of linear equations/inequations. (ii) Linear programming techniques provide solutions only when all the elements related to a problem can be quantified. (iii) The coefficients in the objective function and in the constraints must be known with certainty and should remain unchanged during the period of study. (iv) Linear programming technique may give fractional valued answer which is not desirable in some problems. 3x+2y=160 x+2y=80 5x+2y=200 8x+6y=48 3x+4y=24 4x+3y=0 y = 6 x = 5 Isoprofit line A(0,30) O C (40, 0) B(20, 20) x+2y=60 (60,0) x+y=40 (0,40) Y X
Langue couranteEnglish
Español
Portugues
Français
Deutsche
© 2023 SlideShare de Scribd