Professional Documents
Culture Documents
Advance MME
Advance MME
0 then stationary point is maxima and if | H,| <0 then stationary
point is minima.
Exercise
Find the possible solution to the problems
Max x*y3z subject tox+y+z= 12
An individual purchases quantities x, y, 2 of three different commodities whose
prices are p, r, s respectively. The consumers income is M where M > 2p and
consumers utility function is given by : U(x, y, 2) =. + In [Eco. (H) 2009]
Find the consumers demand for each good as a function of price and income. Show
that the expenditure on good y and z is always equal to the price of the first good.
Consider the problem
Minx? + y2 +z? subjecttoxt+y+z=1.
Using Lagrange Multiplier method find its solution. Also determine if the
corresponding maximization problem has any solution.Prime Academy, www.primeacademy.in
Q4.
Qs.
ai.
Qa.
Consider the problem
Minx +y+z subject to x? + y? +27=1.
Using Lagrange Multiplier method find its solution.
Solve the problem
Minx + 4y + 3z subject to x? + 2y? +42? = b. (Suppose that b > 0 and
take it for granted that the problem has a solution.
Answers of Exercise 4
M.
x=4,y=6,2
x= 13, y= 3,25 1/3, 4.
The minimum point is (a, 2a, 9a), where a = -Vb/6,
Basic Concepts
Optimization Under More Than One Constraints by Lagrange’s Multiplier
Method : When an objective function Z = flx1, x, ... %n) is to be optimized subject
to a more than one equality constraints
BCX, X2, -.. Xn) = C1, BCC, X2, ... Xn) =
the following steps are required :
@ Construct an Auxiliary Function (or Lagrange Function) V defined as :
VOR, x2, Xn) = fer, ¥2, «.. Xn) — LPL Ay- (gj (1, x2, ... xn).
(ii) Find the partial derivatives of V w.r.t all the variable and put them equal to
zero.
(iii) Solve these equation with equality constraints to obtain the values of all
variables.
+ 8m(X1, X2, --. Xn) = Cm
Exercise 5
Solve the problem
Max(min) f(x, y, 2) = x? + y? +2?
Subject to the constraints
x+2y+2=1 and 2x-y-32=4
Solve the following problem
Min f (x,y,z) = x2 —2x+2y? +227 +2
Subject to the constraints
x+y+z=land2x-y-z=5
By using Lagrange method, find possible solutions to the problem
Max(min) f (x,y,z) = x+y +z
Subject to the constraints
x? +y? +2? = Landx—-
Solve the problem
Max(min) f (x,y,z) =x +y
Subject to the constraints
x? 4+ 2y? +27 = 1andx+y+Prime Academy, www.primeacademy.in
Ql.
Q.
nswers of Exercise 5
16
f(x,y, 2) is minimum for x y= ed
15
f(y, z) is minimum for x = 2,y
x,y, 2) is minimum for x = —4,y = -2,2 = —2, and f(x,y, 2) is maximum
9,2) is minimum f yin 2 and f(e,9,2) is maxi
forx = 1,y=0,2=0.
f (x,y,z) is minimum for x =0,y =0,z=1., and f(x,y,z) is maximum for
xatysiz=-2
Basic Concepts
Economic Interpretations of Lagrange Multipliers :
When an objective function Z = fix, x2, ... Xx) is to be optimized subject to a more
than one equality constraints
SiC X2, os Fn) = C1 SaKs ¥2, 2. Xn) = C2, «25 Sms X25 + Xn) = Cm
then the Lagrange Multiplier 4; = 2;(c) for the i constraint is the rate at which
the optimal value of the objective function changes w.r.t. changes in the constant
c.. The number A; is referred to as a shadow price or marginal value imputed to a
unit of resource i.
Suppose we change the constants ¢ = (c1, ¢2, ..., ¢m) by de = (de1, de2, ..., dem) then
df*(c) = YM hyde,
And, f*(¢ + de) = f*(c) +0"
t
y)
Exercise 6
Consider the problem
Max(min) f (x,y,z) = x? + y? + 2?
Subject to the constraints
x42y+c= 1 and 2x-y-32=4
(i) Solve this problem using Lagrange Multiplier Method.
(ii) Suppose we change the first constraint to x + 2y + ¢ = 0.9 and the second
constraint to. 2x - y — 3z = 4.1, estimate the new value of the objective
function.
Consider the problem Max f(x,y) = x+y Subject to g(x,y) =x? +y =1
(i) Write down the Lagrangean function for the problem and solve the
necessary conditions in this case.
Gi) If the constraint is replaced by g(x,y) = x + y = 1.1 then find the change
in the optimal value of the objective function.
Q3.(i) Solve the following problem
Gi)
Max(min) f(x,y) =x+y
Subject to the constraints
x? + 2y? +227 =1 and x+y+c=1,
Suppose the constraints changes to x? + 2y? +z? = 0.9 and x+y+z2=1.2Prime Academy, www.primeacademy.in
1).
(ii).
2.)
3.
Q4.
What is the approximate change in the maximum/minimum values of the objective
function.
Answers of Exercise 6
=i7-
noctnerecl z=
df*(c) ==, New f*(c) = a
x=ty=%eli) df=
F@Y/2) is, minimum for x
4
xehyshc5-2
0,y =0,2=1, and f(x,y,2) is maximum for
Basic Concepts
Envelope Theorem : This theorem is used to determine the change in the value of
objective function due to change in the value of a parameter. Let z = fx, y, a) be an
objective AiGflon witha. parameter a. thea first of al find dE g@ye at which the
function is maximunvminimum, Then find the value 2 at that point, represents the
rate of change of optimum value of the objective function as parameter ‘a’ changes.
This optimum value represented as z* can also be obtained by substituting the value
of x and y at optimum point in the given function z = fx, y, a)
Exercise 7
Envelope Theorem
Determine the effect of an increase in the value of a on the optimum value of the
function y= 2x? -ax+a",
Determine whether the function z=." + y’ -2ax-day+a° has a maxima or minima,
where a is a positive parameter. If z* denote the optimum value of the function,
find “~ by envelope theorem. Verify your answer by alternative method.
la
Determine whether the function ¢=4a~x?—y? subject to the constraints ax +3ay = 10
has a maxima or minima, where a is a positive parameter, If z* denote the optimum
ee de -
value of the function, find “by envelope theorem. Verify your answer by
la
alternative method.
A firm uses inputs L and K to produce a target level of output Q = LK. The prices
per unit of Land K are w and r, respectively. Using the Lagrangian method solve
the following minimization problem [Eco. (H) II Sem. 2014]
Min CLK) = wh +k
LK
Subject to
Q=LKPrime Academy, www.primeacademy.in
(i) Find the cost minimizing inputs L* and K*.
(ii) Find the optimal value function C* as a function of w, r and Q.
(ii) Apply the envelope theorem to find the derivative of the optimal value
function C*(w, r, Q) with respect to Q.
QS. x(a,b) = AVab is a production function for good x and y using inputs a and b, Use
the Lagrangian method to find the amount of factors required to produce an output %
at minimum cost, when prices of inputs are p, and p,. Check the second order
conditions and verify the envelope theorem.
Q6. Let f(x,y) = (x? — @xy)e” be a function of two variables with o as a constant
and a 40.
(i) Find the critical points of f and decide for each of them if it is a local
maximum point, local minimum point or a saddle point.
(i) Let (x, y*) be the critical point where x* # 0 and let f*(ct) = fix", y*). Find
LO and show that if we define f(x,y,a) = (x? —axy)e? then
co to [Eco. (H) IT Sem. 2022]
Maxima, ——
xima, 7
For Full Course Video Lectures of
ALL Subjects of Eco (Hons), B Com (H), BBE,
MA Economics, NTA UGC NET Economics,
Indian Economic Service (IES)
Register yourself at
Www.primeacademy.in
Dheeraj Suri Classes
Prime Academy
+91 9899192027Chapter e
Linear Programming
After learning this chapter you will understand :
Linear Programming Problem.
Formation of Linear Programming Problem.
Solution of a LPP by Graphical Method.
Duality Theory.
Shadow Price.
For Full Course Video Lectures of
ALL Subjects of Eco (Hons), B Com (H), BBE,
MA Economics, NTA UGC NET Economics,
Indian Economic Service (IES)
Register yourself at
www.primeacademy.in
Dheeraj Suri Classes
Prime Academy
+91 9899192027Prime Academy, www.primeacademy.in
Basic Concepts
1. Inequation : A mathematical statement comparing two terms with less than (<) or
greater than (>) sign is known as inequation,
Linear Programming : Linear programming is an optimization technique for
finding an optimal solution (maximum or minimum) for an objective function,
which is a linear function of two or more variables, subject to various constraints in
the form of linear inequations (or equations).
wv
Note : Every linear programming problem has two important features :
(an objective function to be maximized or minimized.
(ii) constraints or restrictions.
3. Objective function : A linear function of two or more variables which has to be
maximized or minimized, under the given restrictions in the form of linear
inequations, is called objective function.
4. Linear constraints : The linear inequ ations in one or more variables are called the
linear constraints.
5. Non-negativity constraint : A set of constraints that require the value of each
decision variable to be either zero or more than zero.
6. Solution of a Linear Programming Problem : A set of values of decision
variables which satisfy all the linear constraints of a linear programming problem
is called the solution of such LPP.
7. Feasible solution : Any solution of a LPP which also s
restrictions of such LPP is called feasible solution.
Feasible region : The set of all feasible solutions is called the feasible region.
Infeasible solution : Any point lying outside the feasible region of the LPP. It
violates any one or more constraints.
10. Optimal feasible solution : Any point in the feasible region which maximizes or
minimizes the objective function is called the optimal solution.
11. Optimization technique : The processes of obtaining the optimal solution are
called optimization technique.
12. General model of LPP : The general model of a LPP having n decision variables
and m constraints can stated in the following form :
Maximize or minimize 7 = 64,434, + 6,4, Hout e,xy
itisfies the non negativity
oe
Subject to the linear constraints :
Gy 1Xy + Ay2Xz + Ay3X3 +.
4X1 + Az2X2 + Gy3X3t-
Fdintn(S = 2)br
stOonXn(S,
m1 X1 + Am2X2 + AmzXzt....- +OmnXn(S,=,2)bn
And, 4, Xop00veeeXn ZO
where,
(i) Zis the objective function
Gi) “x, are decision variables.
Mathematical Methods 22 By Dheeraj Suri, 9899-192027Prime Academy, www.primeacademy.in
(iii) In the set of constraints (<, =, >) means that each constraint may have any
one of these three sign.
13. Steps required to Form a LPP : To form a LPP from the given problem the
following steps are taken :
(i) Identify decision variables from the given problem and denote them by x1,
Bijcerecshas
(ii) Form the objective function expressing it as a linear combination of decision
variables.
(iii) Identify the constraints and express them in the form of linear inequations
(or equations) of decision variables
(iv) Add the non-negativity restriction on the decision variables, because the
physical objects can never have negative values.
Exercise 1
Formation of a Linear Programming Problem :
QI. A carpenter has 90, 80 and 50 running feet respectively of teak, plywood and
rosewood. The product A requires 2, | and | running feet and product B requires 1,
2 and 1 running feet of teak, plywood and rosewood respectively. If A would sell
for Rs. 48 and B would sell for Rs. 40 per unit, how much of each should he make
and sell in order to obtain the maximum gross income out of his stock of wood.
Give a mathematical formulation to this linear programming problem
Q2. A factory owner has to purchase two types of machines, A and B, for his factory.
The requirements and limitation for the machines are as follows :
Area occupied by Skilled men for Daily output in
the machine each machine units
Machine A 1000 sq. M. 12 men 60
Machine B 1200 sq. M. 8 men 40
He has an area of 9000 sq m. available and 72 skilled men who can operate the
machines. Form a LPP to determine how many machines of each type should he
buy to maximize the daily output?
Q3. A company uses three machines to manufacture two types of shirts, of half sleeves
and full sleeves which they make and sell. The number of hours required on
machines M1, M2, M3, for one shirt of each type are as follows:
M M> Ms
Half sleeves 1 = /S
Full sleeves 2 1 8/5
None of the machines can be operated for more than 40 hours per week. The profit
on each half sleeves shirt is Rs. 1 and profit on each full sleeves shirt is Rs. 1.50.
Form the above problem as LP model to find how many of each type of shirts
should be made in maximizing the company’s profits? DO NOT SOLVE
Q4. °°, A boat manufacturing company, makes three different kinds of boats. All can
be made profitably in this company, but the company’s production is constrained
by the limited amount of labour, wood and screws available each month. The
Mathematical Methods 2.3 By Dheeraj Suri, 9899-192027Prime Academy, www.primeacademy.in
director will choose the combination of boats that maximizes his revenue in view
of the information given in the following table:
Input Row Boat |Canoe | Kayak | Monthly
Availability
Labour 12 7 9 1260 hours
Wood Board (feet) _| 22 18 16 19008
Screws (kg) 2 4 3 396 k;
Selling Price in Rs._| 4.000 2,000 5,000
Formulate the above as a linear programming problem.
Q5. Two tailors, A and B, earn Rs. 150 and Rs. 200 per day respectively. A can stitch 6
shirts and 4 pants while B can stitch 10 shirts and 4 pants per day. Form a linear
programming problem to minimize the labour cost to produce at least 60 shirts and
32 pants.
Q6. A horticulturist wishes to mix fertilizer brands that will provide a minimum of 15
units of potash, 20 units of nitrates, and 24 units of phosphates. Brand 1 provides 3
units of potash, | unit of nitrates and 3 units of phosphates; it costs Rs. 120. Brand
2 provides 1 unit of potash, 5 units of nitrates and 2 units of phosphates; it costs
Rs. 60. Formulate the above as a linear programming problem to find the least cost
combination of fertilizers that will meet the desired specifications.
Q7. A carpenter has started a workshop in which he manufactures handcarts. Each cart
consists of a frame and two wheels. A frame uses 3 hours and a wheel uses 2 hours
of labour of which 90 hours per week are available. The carpenter wants that he
should manufacture at least 10 carts during a week. The cost of a frame is Rs. 500
and that of wheel is Rs. 200. Formulate the above as a linear programming
problem to Minimize the cost.
Q8. A retired person wants to invest up to an amount of Rs. 30,000 in the fixed income
securities. His broker recommends investing in two bonds- bond A yielding 7% per
annum and bond B yielding 10% per annum. After some consideration he decides
to invest at the most Rs. 12,000 in bond B and at least Rs. 6,000 in bond A. He also
wants that the amount invested in bond A must be at least equal to the amount
invests in bond B, Formulate LPP if the investor wants to maximize his return on
investment.
Q9. A person is interested in investing Rs. 50,00,000 in a mix of investments. The
investment choices and expected rates of return on each one of them are:
Investment Projected Rate of return
Mutual Fund A 0.12
Mutual Fund B 0.09
Money Market Fund 0.08
Government bonds 0.085
Share Y 0.16
Share X 0.18
The investor wants at least 35 percent of his investment in Government bonds.
Because of the higher perceived risk of two shares, he has specified that the
combined investment in these not to exceed Rs. 80,000. The investor also has
Mathematical Methods 2.4 By Dheeraj Suri, 9899-192027Prime Academy, www.primeacademy.in
specified that at least 20 percent of the investment should be in the money market
fund and that the amount of money invested in shares should not exceed the
amount invested in mutual funds. His final investment conditions is that the
amount invested in mutual fund A should be not more than the amount invested in
mutual fund B. The problem is to decide the amount of money to invest in each
alternative so as to obtain the highest annual total return. Formulate the above as a
linear programming problem.
Ql0. A Mutual Fund Co. has Rs. 15 lakhs available for investment in government
bonds, blue-chip stocks, speculative stocks and short term bank deposits. The
annual expected retums and risk factors are given below :
Investment Type Expected Return Expected Risk
(0 to 100)
Government Bonds 9% ir
Blue-chip Stock 20% 25
Speculative Stocks 35% 45
Short-term Deposits 6% 5
The mutual fund is required to keep at least Rs. 2 lakhs in short term deposits and
not to exceed an average risk factor of 45. Speculative bonds must be at the most
15 % of the total amount invested. How should the mutual fund invest to maximize
its total expected annual return, Formulate this as a linear programming problem.
DONOT SOLVE.
QI1. Shyam, an agriculturist, has a farm with 125 acres. He produces radish, peas and
potato. Whatever he raises, is fully sold in the market. He gets Rs. 5 for radish per kg.,
Rs. 4 for peas per kg and Rs. 5 for potato per kg. The average yield is 1500 kg of
radish per acre, 1800 kg of peas per acre and 1200 kg of potato per acre. To produce
each 100 kg of radish and peas and to produce each 80 kg of potato a sum of Rs.
12.50 has to be used for manure. Labour required for each acre to raise the crop is 6
man-days for radish and potato each and 5 days for peas. A total of 500 man-days of
labour at rate of Rs. 40 per man-days are available. Formulate this as a linear
programming model to maximize the Agriculturist’s total profit.
Q12. A 24 hour supermarket has the following minimal requirements for cashiers:
Period 2d 2 3 4 5 6
Time of day 23-7 7-11 11-15 15-19 19-23 23-3
(24 hour clock)
Minimum no. required 7 2 4 20 10 5
Period | follows immediately after period 6. A cashier works eight consecutive hours,
starting at the beginning of one of the six periods. To determine a daily employee
work sheet which satisfies the requirements with the least number of personnel
formulate the problem as a linear programming problem.
Q13. A city hospital has the following minimum requirements for nurses:
Clock Time Minimum number of
(24 hours per day) |__ Nurses required
6AM.—10A.M. 2
10A.M.~2 P.M. 1
Mathematical Methods 2.5 By Dheeraj Suri, 9899-192027Prime Academy, www.primeacademy.in
2P.M.- 6P.M. 1s
6 P.M. — 10 P.M. 8
10 P.M.-2 AM. 20
2AM.- 6AM. 6
Nurses report to the hospital at the beginning of each period and work for 8
consecutive hours. The hospital wants to determine the minimum number of nurses
to be employed so that there will be sufficient number of nurses available for each
period. Formulate this as a linear Programming Problem by setting up appropriate
constraint, and objective function. Do not solve.
QI4. A drug manufacturer desires to obtain a production schedule to maximize the net
revenue from the sale of two drugs A and B whose net revenues per unit are Rs. 60
and Rs. 40 respectively. The constraints are given below :
(i) capacity to produce drugs is 1000 units of A and B together,
(ii) capacity to produce containers is 1600 units of A or 800 units of B,
(iii) labour is available for 800 units of A and 1600 units of B.
What product mix of A and B should be produced so as to maximize net revenue ?
Formulate the problem as LP model and DO NOT SOLVE.
QI5. A manufacturer produces two different models X and Y of same product. The raw
materials A and B are required for production. At least 18 kg of A and 12 kg of B
must be used. Also at most 34 hours of labour are to be utilized. 2 kg of A are
needed for each model X and 1 kg of A, for each model Y. For each model X and
Y, [kg of B is required. It takes 2 hours to manufacture a model X and 1 hour to
manufacture a model Y. The profit is Rs. 50 for each model X and Rs. 30 for each
model Y. Formulate the above as LPP to determine how many units of each model
should be produced to maximize profit. Do Not Solve
Answers of Exercise 1
de Max. Z = 48x; + 40x2, Subject to constraints
2x) + X2 S$ 90, x; + 2x2 S 80, x1 + X2 $50, x1, x2 20,
2 Max. Z = 60x, + 40x2, Subject to constraints
1000x; + 1200x2 < 9000, 12x; + 8x2 < 72, x1, x2 > 0,
3. Max. Z = x; + 1.5x2, Subject to constraints
X1 + 2x2 $40, 2x1 +x2< 40, $x1 + 4x2 < 40, x1, x22 05
4. Max. Z = 4000x; + 2000x2 + 5000x3, Subject to constraints
12x) + 7x2 + 9x3 < 1260, 22x) + 18x2 + 16x3 < 19008,
2x) + 4x2 + 3x; < 396, x1, X2 2 0,
a Min. Z = 150x; + 200x2, Subject to constraints
6x1 + 10x22 60, 4x1 + 4x2 > 32, x1, x2 20,
9. Max. Z = 0.12x; + 0.09x> + 0.08x3 + 0.085x4 + 0.16x5 + 0.18x6,
Subject to constraints
Ky FX2 +X3 +X4+X5 + Xe S 50,00,000, x42 17,50,000, xs + x6 < 80,000,
x3 > 10,00,000, Xs + Xp S Xi + X2, X1 SX2, X1, X2, Xs, X4, Xs, X6 = 0,
Mathematical Methods 2.6 By Dheeraj Suri, 9899-192027Prime Academy, www.primeacademy.in
10. Max. 09x) + 0.2x2 + 0.35x3 + 0.06X4,
Subject to constraints
X1+X2+X3+X4< 15,00,000, x4 >2,00,000, x3 < 2,25,000, x1, X2, X3, x4, 20
UW. Max. Z = 7072.5x; + 6775x2, + 5572.5x3, Subject to constraints
Xi + X2 + X3 S125, 6x1 + 5x2 + 6x3 < 500, x1, X2, x3 2 0,
12, Min. Z =x, + x2 + X3 + X4+Xs + Xe,
Subject to constraints
Xi + X22 20, Xa + X32 14, X3 + X42 20, Xa t+Xs2 10,
Xs +X625, Xi +X62>7, X1, X2, X3, X4, Xs, Xo 20,
13, Min, Z =x; + x2 +X5+X4 4X5 4X5,
Subject to constraints
X1+%2>7, Xo + X32 15, x3 +X4>8, X4 Xs > 20,
X5 + X62 6, X)+X622, X1, X2y X3, Xt, Xs, Xo 20,
14. Max. Z= 60x1 + 40x2,
X1+Xx25 1000, x)/1600 + x/800<1, x, $800, x2 5 1600, xi, x2 20,
Basic Concepts
1. Graphical method to solve a LPP : To solve a linear programming problem
having at most two variables we use graphical method.
Note :Graphical method is not suitable for LPP having more than two variables. They
are solved by using simplex method.
wv
Steps required to solve a linear programming problem by corner point
method :
(i) Write down the equations representing the given inequations.
(ii) Plot the equations obtained in step (i) on the same graph.
(iii) Determine the feasible region using the given inequations.
(iv) Find the coordinates of the corner points of the feasible region obtained in
step (ii).
(v) Evaluate the objective function at each of the corner point obtained in step
(iv) to determine its maximum or minimum value.
3. Unbounded Solution : When the feasible region of the given LPP is not bounded
and the objective function Z may take arbitrarily large values then such type of
problems are called problems having unbounded solution.
4. Multiple Optimal Solution : If the objective function Z of a LPP has
optimal(maximum or minimum) solutions at more than one points then it is said to
have multiple optimal solutions.
Es Infeasibility : If there is no common (feasible) region between the constraints then
such problem is known to have infeasible solution e.g. x + y <1; 2x + Sy > 10.
Mathematical Methods 27 By Dheeraj Suri, 9899-192027Prime Academy, www.primeacademy.in
Exercise 2
QI. Maximize Z= 10x + 6y
Subject to
3xtys12; 2x+5ys34, x y20
By graphic method.
Q2. Solve the following LPP by graphic method :
Maximize Z = 2x + Sy
Subject to
x+dy<04; 0 Bxty<21; 9 xt+y<9: xy20
Q3. Solve graphically :
Max. Z = 50x + 30y
Subject to
Qxty>18; 9 x+y>12; Bx+y<34; uyed
Q4. Find Graphically the minimum of :
Z= 16x + 25y
Subject to constraints,
Qx+y27, x+y25, 2x+Sy216, x, y20
QS. Solve the following linear programming problem graphically :
Maximize Z = 3x + 4y
Subject to
10x+8y<80 9; -x22y-10 + yS6; KZ
Q6. Solve graphically :
Minimize : z= 200m + 400x2
Subject to the constraints :
1
ai+a22200, ix + 222 100, ott gH S35, ay, 20
Q7. Solve the following L.P.P. by graphic method :
Minimize Z = —x; + 2x2
Subject to constraints,
—x) + 3x2 < 10, x +%2 $6, Xi—x2 <2, x1, 3220
Q8. Solve the following L.P.P by graphic method :
Maximize Z = 2.75x)+4.15x2
Subject to : 2x) + 2.5x2< 100, 4x) + 8x2 2 160
7.5x2 + 5x2 150, *, 220.
Q9. Minimize Z = x ~ Sy + 20, subject to constraints
x-y2>0, +2y>2, x>3, y<4, xy>0
Q10. Solve the following linear programming problem graphically:
Maximise z = 4x + 6y subject to constraints
xt+y=5, x22, ys4, xy20.
QIL. Using graphic method, find the maximum value of : z = 7x + 10y
Subject to x + y < 30,000, y = 12,000
x>6,000 x>y xy20
Mathematical Methods 2.8 By Dheeraj Suri, 9899-192027Prime Academy, www.primeacademy.in
Q12. In linear programming what is a ‘Feasible Solution’ and ‘Infeasible Solution’
Solve the following by graphic method and comment on the result :
Min. : Z= 3x1 + 2x2
Subject to
—2x1 + 3x2 $9, 3x1 — 2x. $-20, x, 20
Q13. What are “redundant constraints”? Which constraints are redundant in the
following with
x1, 20 4x1 + 3x $ 12, —mtme21, mtms4, nt+m<6.
Q14. In linear programming what is “Multiple Solution Situation”. Solve the following
graphically and interpret the result :
Max. : Z = 4x + 3y
Subject to
3x + 4y<24, 8x4 6y