13.

Formulation 13.03 – 13.07

Graphical 13.08 – 13.08
Simplex 13.09 – 13.12
1. BOOST IMMUNITY SYSTEM 2. WASH YOUR HAND FREQUENTLY AND
CAREFULLY.

3. TAKE BATH AFTER REACHING HOME IF 4. AVOID TOUCHING YOUR FACE

YOU WENT OUTSIDE.

5. DO NAMSKAR AND STOP SHAKING 6. DON’T SHARE PERSONAL ITEMS

HANDS AND HUGGING PEOPLE.

7. AVOID EATING OR DRINKING IN PUBLIC 8. COVER YOUR MOUTH AND NOSE WHEN YOU
PLACES COUGH AND SNEEZE

9. CLEAN AND DISINFECT SURFACES 10. TAKE SOCIAL DISTANCING SERIOUSLY

11. DO NOT GATHER IN GROUPS 12. WASH FRESH GROCERIES

13. WEAR A (HOMEMADE) MASK 14. SELF-QUARANTINE IF SICK

GILOY, NEEM, TULSI AND YOGA AMLA IN ANY FORM
OTHER AYURVEDIC
BEVERAGE

EXERCISE OR ANY SPORT GREEN VEGETABLES HOMEMADE FOOD

JAGGERY (GUD) ANY PURE OIL (EXCEPT FRUITS (ESPECIALLY CITRUS)

REFINED)

MILK, CURD, LASSI, GHEE PULSES

ETC.

FLOUR (THE MOST DESTRUCTIVE SUGAR, JUNK FOOD

SUBSTANCE LIKE BREAD, NAN,
BHATURE, BURGER, PIZZA, JALEBI,
SAMOSA, KACHAURI, PAAV),
 LINEAR PROGRAMMING PROBLEM
THEORY
1. MEANING OF LINEAR PROGRMMING:
Linear programming is a mathematical technique for determining the optimal allocation of re-
sources and achieving the specified objective when there are alternative uses of the resources
like money, manpower, materials, machines and other facilities.

2. PRACTICAL APPLICATION OF LINEAR PROGRAMMING

[2000(N), 2003(M), 2007(M)] (7 Marks)

Linear programming can be used to find optional solutions under constraints.

(a) In production:
 Product mix under capacity constraints to minimise costs/maximise profits along
with marginal costing.
 Inventory management to minimise holding cost, warehousing / transporting from
factories to warehouses etc.
(b) Sensitivity Analysis: By providing a range of feasible solutions to decide on discounts
on selling price, decisions to make or buy.
(c) Blending: Optional blending of raw materials under supply constraints.
(d) Finance: Portfolio management, interest/receivables management.
(e) Advertisement mix: In advertising campaign analogous to product management and
product mix.

3. METHODS OF LINEAR PROGRAMMING:

(i) Graphical method: It involves the following:
(a) Formulating the linear programming
problem.
(b) Plotting the capacity constraints on the
graph paper.
(c) Identifying feasible region and coordinates
of corner point.
(d) Testing the corner point which gives
maximum profit.
(e) For decision making purpose, sometimes, it
is required to know whether optimal point
leaves some resources unutilized.

13. | 1
 (ii) Simplex method: The Simplex method is a computation procedure for solving
linear programming problems. It is iterative optimizing technique.

4. CHARACTERISTICS OF THE DUAL PROBLEM: [Imp.]

(a) For any linear programming model called primal model, there exists a companion
model called the dual model.
(b) The number of constraints in the primal model equals the number of variables in the
dual model.
(c) The number of variables in the primal problem equals the number of constraints in the
dual model.
(d) Dual of the prima‟s dual problem is the primal problem itself.

5. LIMITATION OF LINEAR PROGRAMMING PROBLEM:

[1998(M), 2000(N), 2004(M)] (4 Marks)
(a) A primary assumption of linear programming in that the objective function and every
constraint function must be linear however, programming problems which are non-
linear arise quite frequently.
(b) It may not be possible to solve those problems using linear programming, in which non-
linearity arises because of joint interaction between some of the activities regarding the
total measure of effectiveness or total uses of some resources.
(c) In linear programming problem, fractional values are permitted for the decision
variables. However, many decision problems require that the solution for decision
variable should be obtained in non-fractional value.
(d) In linear programming problem, coefficients in the objective function and the constraint
equations must be completely known and they should not change during the period of
study.

6. VARIABLE IN LINEAR PROGRAMMING: [2003(M)] (3 Marks)

1) Slack Variable: In order to convert every constraint of type „less than equal to‟ into an
equality constraint so as to arrive at a solution of LPP, we add a variable to each of such
constraint. This variable is known as slack variable.
2) Artificial Variable: In order to convert every constraints of the type „greater than equal
to‟ into an equality constraint so as to arrive at a solution of LPP, we first subtract a
surplus variable and then add a variable. This variable is known as artificial variable.

Note

“Every great dream begins with a dreamer. Always remember, you have within you the
strength, the patience, and the passion to reach for the stars to change the world.”

13. | 2
 PRACTICAL
FORMULATION
1. WX Ltd manufacturing two products A and B, Both products pass through two production departments,
mixing and shaping. The organization‟s objective is to maximize contribution to fixed costs.
Product A is sold for Rs. 1.50 whereas product B is priced at Rs. 2.00. There is unlimited demand for
product A but demand for B is limited to 13,000 units per annum. The machine hours available in each
department are restricted to 2,400 per annum. Other relevant data are as follows.
Machine hours required Mixing Hours Shaping Hours
Product A 0.06 0.04
Product B 0.08 0.12
Variable cost per unit Rs.
- Product A 1.30
- Product B 1.70

2.. Mr. X has ₹ 10 lacs which he wants to invest in the share market in anticipation of having good returns. He
wants to invest only in two stocks and one mutual fund with an investment allowed in each stock or mutual
fund not being more than ₹ 7 lacs.
Expected rate of Return Risk rating (on a scale of 0 to 10)
Stock L 15% 5
Stock M 18% 8
Mutual Fund 13% 4
He does not want to accept aaverage rate of return below 12% or a risk factor above 6.
How much money he should invest in each alternative so as to obtain the highest annual total return?
Formulate the above as a linear program and present the inequalities with coefficients in their simplest
integer forms.
{Ans: } [2015(N)] (8 Marks)

3. A Computer Company produces three types of models, which are first required to be machined and then
assembled. The time (in hours) for these operations for each model is given below.
Model Machine Time Assembly Time
P III 20 5
P II 15 4
Celeron 12 3

13. | 3
The total available machine time and assembly time are 1,000 hours and 1,500 hours respectively. The
selling price and other variable cost for three models are:
P III P II Celeron
Selling Price (Rs.) 3,000 5,000 15,000
Labour, Material and other Variable Costs 2,000 4,000 8,000
(Rs.)

The company has taken a loan of Rs. 50,000 from a Nationalised Bank, which is required to be repaid on
1.4.2001. In addition, the company has borrowed Rs. 1,00,000 form XYZ Cooperative Bank. However,
this bank has given its consent to renew the loan.
The Balance Sheet of the company as on 31.3.2001 is as follows:
Liabilities Rs. Assets Rs.
Equity Share Capital 1,00,000 Land 80,000
Capital Reserves 20,000 Building 50,000
Profit & Loss Account 30,000 Plant & Machinery 1,00,000
Long-term Loan 2,00,000 Furniture etc. 20,000
Loan from XYZ Cooperative Bank 1,00,000 Vehicles 40,000
Loan from Nationalised Bank 50,000 Cash 2,10,000
5,00,000 5,00,000

The company is required to pay a sum of Rs. 15,000 towards the salary. Interest on long-term loan is to be
paid every month @ 18% per annum. Interest on loan from XYZ cooperative and Nationalised Bank may
be taken as Rs. 1,500 per month. The company has already promised to deliver three P III, two P II and
five Celeron type of Computers to M/s ABC Ltd. next month. The level of operation in the company is
subject to the availability of cash next month.
The Company Manager is willing to know that how many units of each model must be manufactured next
month, so as to maximize the profit.
Formulate a linear programming problem for the above.
[2001(M)] (10 Marks)

“As long as I am breathing, in my eyes, I am just beginning.”

“Fortune sides with him who dares.”

13. | 4
4. An investor is interested in investing Rs. 15,00,000 in a portfolio of investment. The investment choices
and expected rates of return on each one of them are:
Investment Projected Rate of Return
Mutual Fund „XY‟ 15%
Mutual Fund „HN‟ 9%
Money Market Fund 8%
Government Bonds 8.75%
Government Bonds 17%
Share „P‟ 17%
Share „Q‟ 18%
The investor wants at least 40% of his investment in Government Bonds. Because of the higher perceived
risk of the two shares, he has specified that the combined investment in these two shares not to exceed Rs.
2,60,000. The investor has also specified that at least 25% 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 int
mutual fund „XY‟ should be no more than the amount invested in mutual fund „MN‟. The problem is to
decide the amount of money to invest in each alternative so as to obtain the highest annual total return.
Required:
Formulate the above as linear programming problem.
{Ans:} [2012(N)] [5 Marks]

5. The owner of Fancy Goods Shop is inerested to determine, how many advertisements to release in the
selected three magazine A, B and C. his main purpse is to advertise in such a way that exposure to
principal buyers of his goods is maximized. Percentages of readers foreach magazine are known. Exposure
in any particular magazine is the number of advertisements released multiplied by the number of principal
buyers. The following data are available:
Particulars Magazines
A B C
Readers 1.0 Lakh 0.6 Lakh 0.4 Lakh
Principal Buyers 20% 15% 8%
Cost per Advertisement 8,000 6,000 5,000
The budgeted amount is at the most 1.0 lakh for the advertisement. The owner has already decided that
magazine A should have no more than 15 advertisements and that B and C each gets at least 8
advertisements. Formulate a Linear Programming Model for this problem.
{Ans:} [NSM]

“There are many aspects to success; material wealth is only one component.

13. | 5
6. A firm produces three products A, B and C. It uses two types of raw materials I and II of which 5,000 and
7,500 units respectively are available. The raw material requirements per unit of the products are given
below:
Raw Material Requirements per unit of Product
A B C
I 3 4 5
II 5 3 5
The labour time for each unit of product A is twice that of product B and three times that of product C. The
entire labour force of the firm can produce the equivalent of 3,000 units. The (marks) minimum demand of
the three products is 600, 650 and 500 units respectively. Also, the ratios of the number of units produced
must be equal to 2 : 3 : 4. Assuming the profits per unit of A, B and C as Rs. 50, 50 and 80 respectively.
Formulate the problem as a linear programming model in order to determine the number of units of each
product which will maximize the profit.
{Ans:} [S.M]

7. Transport Ltd. Provides tourist vehicles of 3 types – 20-seater vans, 8-seater big cars and 5-seater small
cars. These seating capacities are excluding the drivers. The company has 4 vehicles of the 20-seater van
type, 10 vehicles of the 8-seater big car types and 20 vehicles of the 5-seater small car types. These
vehicles have to be used to transport employees of their client company from their residences to their
offices and back. All the residences are in the same housing colony. The offices are at two different places,
one is the Head Office and the other is the Branch. Each vehicle plies only one round trip per day, if
residence to office in the morning and office to residence in the evening. Each day, 180 officials need to be
transported in Route I (from residence to Head Office and back) and 40 officials need to be transported in
Route II (from Residence to Branch office and back). The cost per round trip for each type of vehicle along
each route is given below.
You are required to formulate the information as a linear programming problem, with the objective of
minimising the total cost of hiring vehicles for the client company, subject to the constraints mentioned
above. (only formulation is required. Solution is not needed).
Figs – Rs./round trip
20-seater vans 8-seater car 5-seater small car
Route I – Residence – Head Office and 600 400 300
Back
Route II – Residence – Branch office and 500 300 200
Back
[2008(M)] (8 Marks)

13. | 6
8. The following matrix gives the unit cost of transporting a product from production plants P1, P2 and P3 to
destinations. D1, D2 and D3. Plants P1, P2 and P3 have a maximum production of 65, 24 and 111 units
respectively and destinations D1, D2 and D3 must receive at least 60, 65 and 75 units respectively:
To D1 D2 D3 Supply
From
P1 400 600 800 65
P2 1,000 1,200 1,400 24
P3 500 900 700 111
demand 60 65 75 200
You are required to formulate the above as a linear programming problem. (Only formulation is needed.
Please do not solve)

[P.M.]

9. A Manufacturing company has 100 kg of A, 180 kg of B and 120 kg of C ingredients available per month.
Company can use these materials to make three basic products namely 5 – 10 – 5, 5 – 5 – 10 and 20 – 5 –
10, where the numbers in each case represent the percentage of weight of A, B and C respectively in each
of the products.
The cost of these raw materials are as follows:
Ingredient Cost per kg (₹)
A 64
B 16
C 40
Inert ingredients 16
Selling price of these products are ₹ 32.60, ₹ 34.80 and ₹ 36 per kg respectively. There is capacity
restriction of the company product 5 – 10 – 5, so that company cannot produce more than 30 kg per month.
Only formulate this problem as L.P. Model to determine the productions (in kg) of each product
which will maximize its monthly profit.
2016(N) (6 Marks)

...But success also includes good health, energy and enthusiasm for life, fulfilling relationships,
creative freedom, emotional and psychological stability, a sense of well-being, and peace of mind.”

“Persistence. Perfection.Patience.Power. Prioritize your passion. It keeps you sane.”

13. | 7
GRAPHICAL METHOD
10. A firm makes two products X and Y, and has a total production capacity of 16 tonnes per day. X and Y are
requiring the same production capacity. The firm has a permanent contract to supply at least 3 tonnes of X
and 6 tonnes of Y per day to another company. Each tonne of X require 14 machine hours of production
time and each tonne of Y requires 20 machines hours of production time. The daily maximum possible
number of machine hour is 280. All the firm‟s output can be sold, and the profit made is Rs. 20 per tonne
of X and Rs. 25 per tonne of Y.
Required:
Formulate a linear programme to determine the production schedule for maximum profit by using
graphical approach and calculate the optimal product mix and profit.
{Ans: } [2010(N)] (6 Marks)

11. A market advertising firm desires to reach two type of audiences-customer of annual income of more the
Rs.50,000 (target audience A) and customers with annual income of less than Rs. 50,000 (target audience
B).

The total advertising budget is Rs. 2,000 crores. One programme of TV advertising cots Rs. 500 crores
and one programme on Radio advertising costs Rs. 200 crores. Contract conditions ordinarily require that
there should be atleast 3 programmes for TV and the number of programmes on radio must not exceed 5.
Survey indicates that a single TV programme reaches 7,50,000 customers in target audience A and
1,50,000 in target audience B. One Radio programme reaches 40,000 customers in targer audience A and
2,60,000 customers in target audience B.
Formulate this as a linear programming problem and determine the media mix to maximize the total reach
using graphic method.
[2014(N)] (8 Marks) {Ans: 36,00,000}

12. A manufacturer produces two types of products i.e. X and Y. Each of these products requires three types
of processing. The processing time for processing each unit and the profit per unit are given in the
following table:
Product X Product Y Available capacity
(hr/unit) (hr/unit) per day (hr.)
Process I 12 12 840
Process II 3 6 300
Process III 8 4 480
profit per unit (₹) 5 7
Applying Graphical method, how many units of each product should the company produce per day in
order to maximize profit?
[2016(M)] (8 Mark) {Ans: 40 units and 30 units}

13. | 8
13. The following linear program is presented to you:
Objective:
Maximise Z = 30x + 45y
Subject to: (i) 2x + 3y ≤ 1440
(ii) 9x + 12y ≥ 2160
(iii) 3x + 4y ≥ 1080
(iv) x, y ≥ 0.
You are required to draw the graph taking quantities of x and y in the respective axes in steps of 60 units
(scale 1 cm. = 60 units), determination the optimality and offer your comments on the solution and the
constraints.
{Ans:} [2012(M)] (8 Marks)

13. | 9
SIMPLEX METHOD
14. The following is a linear programming problem. You are required to set up the initial simplex tableau.
(Please do not attempt further iterations or solution).
Maximise:
100x1 = 80x2
Subject to
3x1 + 5x2≤ 150
x2≤ 20
8 + 5 ≤ 300
x1 + x2≥ 25
x1 + x2≥ 0
{Ans:} [2009(N)] (6 Marks)

15. The following information is given relating to the simplex method of a linear program with the usual
notation.
Objective function: Z = x1 + 5x2 (1)
Constraints: 6x1 + 8x2 ≤ 12 (2)
5x1 + 15x2 ≥ 10 (3)
Let s1 be the variable introduced to restate (2) as an equality and let s2 and A2 be variables to restate (3) as
an equality.
If the objective is to maximise Z,
a) What will be the coefficients of s1, s2 and A2 in equation (1) and (3) restated as equality?
b) Identify the slack and surplus variables.
c) Which variables will form part of the initial solution? Why?
d) If the objective is to minimize Z what will be your answer to (i) above?
{Ans} 2015(M) (8 Marks)

16. A small township of 15,000 people requires, on the average, 300,000 gallons of water daily. The city is
supplied water from a central water-works where the water is purified by such conventional methods as
filtration and chlorination. In addition, two different chemical compounds: (i) softening chemical and (ii)
health chemical, are needed for softening the water and for health purposes. The waterworks plans to
purchase two popular brands that contain these chemicals. One unit of Chemico Corporation's product
gives 8 pounds of softening chemical and 3 pounds of health chemical. One unit of Indian Chemical's
product contains 4 pounds and 9 pounds per unit, respectively, for the same purposes.
To maintain the water at a minimum level of softness and to meet a minimum programme of health
protection, experts have decided that 150 and 100 pounds of the two chemicals that make up each product
must be added to water daily. At a cost of Rs. 8 and Rs. 10 per unit respectively for Chemico's and Indian
Chemical's products, what is the optimal quantity of each product that should be used to meet the
minimum level of softness and minimum health standard?
[S.M]

13. | 10
17. A manufacturer of three products tries to follow a policy of producing those which contribute most to
fixed cost and profit. However, there is also a policy of recognising certain minimum sales requirements.
Currently these are:
Product Unit per week
X 20
Y 30
Z 60
There are three producing departments. The product time in hour per unit in each department and the total
times available for each week in each department are:
Time required per product in hours Total hours available
Product X Y Z
Department 1 0.25 0.20 0.15 420
2 0.30 0.40 0.50 1,048
3 0.25 0.30 0.25 529
The contribution per unit of product X,Y, Z is Rs. 10.50, Rs. 9.00 and Rs. 8.00 respectively. The
company has scheduled 20 units of X, 30 units of Y and 60 units of Z for production in the following
week.
You are required to state:
a) Whether the present schedule is an optimum one from a profit point of view and if it is not, what
it should be;
b) The recommendations that should be made to the firm about their production facilities (following
the answer to (a) above).
{Ans:} [S.M.]

18. Given below is an iteration in a simplex table for a maximization objective linear programming product
mix problem for product X1, X2 and X3.
Cj 6 4 10 0 0 0
Basic Quantity X1 X2 X3 S1 S2 S3
Variable
0 S1 400 0 4/3 0 1 -1/3 0
6 X1 400 1 2/3 2 0 1/3 0
0 S3 400 0 5/3 0 0 -2/3 1
Zj 2,400 6 4 12 0 2 0
Cj- Zj 0 0 -2 0 -2 0
Answer the following questions:
(i) Is the above solution feasible?
(ii) Perform one more iteration with X2 entering the solution to get a solution with the same value
for the objective function.
(iii) Indicate the shadow prices.

13. | 11
 (iv) If customer is prepared to pay higher price for Product X 3, then by how much should the
price be increased so that the company‟s profit remains unchanged.
(v) From the given table, derive any one original constraint inequality with the coefficient of
variables in their simplest whole number forms.
{Ans:} [2013(N)] (8 Marks)

19. A company manufactures two products A and B, involving three departments – Machining, Fabrication
and Assembly. The process time, profit/unit and total capacity of each department is given in the
following table:
Machining Fabrication Assembly Profit
(Hours) (Hours) (Hours) (Rs.)
A 1 5 3 80
B 2 4 1 100
Capacity 720 1,800 900
Set up Linear Programming problem to maximize profits. What will be the product-mix at maximum
profit level? What will be the profit? {Ans: }2013(M) (8 Marks)

20. Given below is the relevant portion of the first iteration of a linear program under the simplex method,
using the usual notations.
x1 x2 s1 s2 s3
Quantity Basic Contribution Per Unit 50 40 0 0 0
Variable
150 s1 0 3 5 1 0 0
20 s2 0 0 1 0 1 0
296 s3 0 8 5 0 0 1
(i) Write the initial linear program with the objective function and the equations. The following
questions are to be answered independent of each other and based on the iteration given
above.
(ii) What is the opportunity cost of bringing one unit of x1 into the solution?
(iii) If we bring 4 units of x1 into the solution, by now much will basic variables change?
(iv) What will be the change in the value of the objective function if 4 units of x 2brought into the
solution?
(v) What will be the quantity of the incoming variable?
{Ans: } [2011(N)] (10 Marks)

“As long as I am breathing, in my eyes, I am just beginning.”

“Fortune sides with him who dares.”

13. | 12
21. Given below is an iteration in a simplex table for a maximization objective linear programming project
mix problem for products x, y and z. each of these products is processed in three machines KA-07, KB-27
& KC-49 and each machine has limited available hours.
Cj→ 30 40 20 0 0 0
Ca Basic Value of Basic X Y Z S1 S2 S3
Variable (B) Variable b = (Xa)
30 X 250 1 0 -26/16 10/16 -12/16 0
40 Y 625 0 1 31/16 -7/16 10/16 0
0 S3 125 0 0 11/16 -3/16 1/8 1
s1, s2 and s3 are slack variables for machine KA-07, KB-27 and KC-49 respectively.
Answer the following questions, giving reason in brief:

(i) Does the table above given an „Optimal Solution‟?

(ii) Are there more than one „Optimal Solution‟/ „Alternate Optimal Solution‟?
(iii) Is this solution „Feasible‟?
(iv) Is this solution „Degenerate‟?
(v) Write down the „Objective Function‟ of the problem.
(vi) Write the „Optimal Product Mix‟ and „Profit‟ shown by the above solution.
(vii) Which of these machines is being used to the full capacity when producing according to this
solution?
(viii) How much would you be prepared to pay for another hour of capacity each on machine KA-
07, machine KB-27, and machine KC-49?
(ix) If the company wishes to expand the production capacity, which of the three resources should
be given priority?
(x) What happens if 16 machine hours are lost due to some mechanical problem in machine KB-
27?
(xi) A customer would like to have one unit of product z and is willing to pay higher price for z in
order to get it. How much should the price be increase so that the company‟s profit remains
uncharged?
(xii) A new product is proposed to be introduced which would required processing time of 4 hours
on machine KA-07, 2 hour on machine KB-27 and 4 hours on machine KC-49. It would yield
a profit of ₹ 12 per unit. Do you think it is advised to introduce this product?

13. | 13
DUAL PROBLEMS
22. Formulate the dual for the following linear program:
Maximise: 100x1 + 90x2 + 40x3 + 60x4
Subject to
6x1+ 4x2 + 8x3 + 4x4 ≤ 140
10x1 + 10x2 + 2x3 + 6x4 ≤ 120
10x1 + 12x2 + 6x3 + 2x4 ≤ 50
x1, x2, x3, x4, ≥ 0
(Only formulation is required. Please do not solve.) [2009(J)] (6 Marks)]

23. Formulate the dual problem for the following linear programming problem
Maximisation
Z = 3x1 + 2x2 + 4x3
Subject to the Constraints :
3x1 + 2x2 + 4x3 ≥ 9
2x1 + 3x2 + 2x3 ≥ 5
7x1 - 2x2 - 4x3 ≤ 10
6x1 - 3x2 + 4x3 ≥ 4
2x1 + 5x2 + 3x3 ≥ 3
x1, x2, x3 ≥ 0 NPM

24. Formulate the dual problem for the following linear programming problem
Minimise
Z = 3x1 + 2x2 + 4x3
Subject to the Constraints :
3x1 + 2x2 + 4x3 ≥ 9
2x1 + 3x2 + 2x3 ≥ 5
7x1 - 2x2 - 4x3 ≤ 10
6x1 - 3x2 + 4x3 ≥ 4
2x1 + 5x2 + 3x3 ≥ 3
x1, x2, x3 ≥ 0 NPM

13. | 14
25. Formulate the dual problem for the following linear programming problem
Maximise
Z = x1 - x2 + 3x3
Subject to the Constraints :
x1 + x2 + x3 ≤ 10
2x1 + 3x2 - x3 ≤ 20
2x1 + 3x2 ≤ 50
And x1, x2, x3 ≥ 0 NPM

26. Formulate the dual problem for the following linear programming problem
Maximise
Z = 10y1 + 8 y2 – 6y3
Subject to
3y1 + y2 – 2y3 ≤ 10
- 2y1 + 3y2 – y3 ≥ 12
And y1, y2, y3 ≥ 0 NPM

27. Formulate the dual problem for the following linear programming problem
Minimise
Z = 30x2 + 20x2
Subject to
- x1 – x2 ≤ -8
-6x1 - 4x2 ≥ -12
5x1 + 8x2 ≤ 20
x1, x2 ≥ 0 NPM

28. The simplex tableau for a maximixation problem of linear programming is given below:
Cj Product Mix X1 X2 S1 S2 Quantity
5 X2 1 1 1 0 10
0 S2 1 0 -1 1 3
Cj 4 5 0 0
Zj 5 5 5 0 50
Cj - zj -1 0 -5 0
Answer the following questions giving reasons in brief:
(i) If s1 is slack in machine A (in hours/week) and s2 is slack in machine B (in hours/week),
which of these machines in being used to the fullest capacity?
(ii) A customer would like have to one unit of product x1 and is willing to pay more than the
normal price in order to get it. How much should the price be increased in order to maintain

13. | 15
 same level of profit?
(iii) Machine A (associated with slack s1 in hours/week) has to be shut down for repairs for 2
hours next week. What will be the effect on profits?
(iv) How much would you be prepared to pay for another hour (per week) of machine A
and machine B? 2017 (N) 4 Marks

There are no secrets to success; don‟t waste time looking for them. Success is the result of perfection,
hard work, learning from failure, loyalty to those for whom you work, and persistence.”

13. | 16
  CA FINAL
 SCM & PE / AMA

FACE 2 FACE

|| PENDRIVE || ||GOOGLE DRIVE ||

UPDATED STUDY MATERIAL AND UPDATE LECTURES

9871 - 77 - 55 - 66
Join Us on FACEBOOK Join Us on YOUTUBE

 R S PATHSHALA Page,  R S PATHSHALA Page,

 CA Ravi Shanker  CA Ravi Shanker

13. | 17
13. | 18
13. | 19
13. | 20
13. | 21
13. | 22
13. | 23
13. | 24
13. | 25
13. | 26
13. | 27
13. | 28
13. | 29
13. | 30
13. | 31
13. | 32
13. | 33
13. | 34
13. | 35
13. | 36
13. | 37
13. | 38
13. | 39
13. | 40
13. | 41
13. | 42
13. | 43
13. | 44
13. | 45
13. | 46
13. | 47
13. | 48
13. | 49
13. | 50
13. | 51
13. | 52
13. | 53
13. | 54
13. | 55
13. | 56
13. | 57
13. | 58
13. | 59
13. | 60
13. | 61
13. | 62
13. | 63
13. | 64
13. | 65
13. | 66
13. | 67
13. | 68
13. | 69
13. | 70
13. | 71
13. | 72
13. | 73
13. | 74
13. | 75
13. | 76
13. | 77
13. | 78
13. | 79
13. | 80
13. | 81
13. | 82
13. | 83
इसमें सबकु छ है ₹ 4,000/-

इसमें सबकु छ है ₹ 6,000/-

इसमें सबकु छ है
₹ 5,000/-

इसमें सबकु छ है ₹ 9,000/-