UNIT-4

BY:
Dr. Anu Sayal
Associate Professor
Centre for Artificial
Intelligence
MITS Deemed University,
Gwalior
 UNIT-4
Optimization is the process of finding the best possible
solution to a problem from all feasible solutions.

The best solution may involve:

 Maximizing profit, production, efficiency
 Minimizing cost, time, distance, waste

Thus optimization helps in decision making and

resource allocation.
Basic Components of Optimization

1. Decision Variables
Variables whose values are to be determined.
Example
x = number of units produced

2. Objective Function

A mathematical expression representing the goal of

the problem.
Example
Maximize profit
Z=5x+4y
Where Z = objective value
3. Constraints

Restrictions or limitations on decision variables.

Example
2x+y≤100
This means available resources limit production.

4. Feasible Region

The set of all solutions that satisfy the constraints.

5. Optimal Solution

The best solution that gives maximum or minimum

value of the objective function.
Mathematical Form of Optimization
Example of Optimization
 Unconstrained Optimization

Definition

Optimization in which no restrictions or constraints

are placed on decision variables.
The variable can take any value.

Mathematical Form

Optimize f(x)
No constraints are present.
 Constrained Optimization

Definition
Optimization problems that include restrictions
(constraints) on decision variables.
The solution must satisfy all constraints.
 Linear Programming

It is a mathematical technique useful for allocation

of ‘scarce’ or ‘limited’ resources, to several
competing activities on the basis of a given criterion
of optimality.

Four components of any LP model are:

(i) Decision variables,
(ii) objective function,
(iii) constraints, and
(iv) non-negativity
Assumptions of an LP model are:
(i) certainty,
(ii) additivity,
(iii) proportionality, &
(iv) divisibility
GENERAL MATHEMATICAL MODEL OF LINEAR
PROGRAMMING PROBLEM
 GUIDELINES ON LINEAR PROGRAMMING MODEL
FORMULATION

LP model formulation requires:

(i) identification of decision variables and input data,

(ii) formulation of constraints, and

(iii) objective function

 UNIT-5

BY:
Dr. Anu Sayal
Associate Professor
Centre for Artificial Intelligence
MITS Deemed University, Gwalior
THE LU FACTORIZATION OF A MATRIX:
DEFINITION: An elementary matrix is a square matrix obtained from the identity
matrix by a single row operation.

1. EXAMPLE: Find which of these is elementary matrix.

DEFINITION:

EXAMPLE: Consider the following matrices

DEFINITION: An LU factorization of a matrix A is the representation of A as the
product A = LU of a (square) lower triangular matrix L and an upper triangular matrix U,
which is the same size as A.

EXAMPLE:
1. Find the LU factorization of

Sol.
2. Find the LU
factorization of

Sol.
 THEOREM: If a matrix A can be reduced to row echelon form
without row interchanges, then A has an LU factorization.

EXAMPLE: Solve the following linear system by using LU factorization.

Sol. Let
 Question 1:

 Question 2:
GAUSS ELIMINATION METHOD
Example-1: Apply Gauss elimination method to solve the equations:
OR
 GAUSS JORDAN METHOD

EXAMPLE 1: Apply Gauss Jordan method to solve the equations:

 LINEAR
PROGRAMMING

1
Topic Objectives
1. To graph linear inequalities in two variables
2. To solve linear inequalities in two variables
3. To formulate the linear programming problem
4. To use graphical methods to find the optimal value of a
linear function subject to constraints
 Linear Programming

Linear programming is a mathematical concept used to

determine the solution to a linear problem. Typically, the goal of
linear programming is to maximize or minimize specified
objectives, such as profit or cost.

3
 GRAPHICAL METHOD

Graphical optimization is a simple method for

solving optimization problems involving one or
two variables. For problems involving only one
optimization variable, the minimum (or
maximum) can be read simply from a graph of
the objective function.

4
5
6
7
 Graphing Linear Inequalities
Example 1: Graph x  2 Graph y  −3

y y

x x
 Procedure for Graphing Linear Inequalities

y
6 Any point in the upper
5 half-plane satisfies the
inequality

>
4

Any point in the

3 3x + 2y > 6
2
lower half-plane
satisfies the 1

inequality 0
x
-2 -1 0 1 2 3 4
-1
3x + 2y < 6
< -2

-3
 Graphing Linear Inequalities
Example 2
Graph y  2x −1
y = 2x −1
y

(0.5,0) x
(0,-1)
x 0 0.5 Any point in the lower
y -1 0 half-plane satisfies the
inequality, so this region
is shaded.
 Graphing Linear Inequalities
Example 3
x − 2y 1
Graph the two linear inequalities:
3x + 2 y  6
y
𝑥 − 2𝑦 ≤ 1 3𝑥 + 2𝑦 ≥ 6
x − 2y =1
x 0 1
x 0 2
y -0.5 0
y 3 0
x

3x + 2 y = 6
Points must satisfy both inequalities (overlap of
individual shaded regions)
EXAMPLE 1:

12
13
14
15
16
17
18
EXAMPLE 2:

19
20
21
 Example to Formulate the Linear
programming Problem
A small company produces and sells two types of tables: type-A and
type-B.

Each type-A table will result in a profit of $50, and each type-B table will
result in a profit of $54.
A type-A table requires 3 hours of carpentry and 1 hour of painting. A
type-B table requires 2 hours of carpentry and 1 hour of painting.
Each day there are 16 hours available for carpentry and 8 hours
available for painting.

How many tables of each type should be made each day to maximize
profit?
Solution:
Organize the Information:
Table A (X) Table B (Y) Time Available

Carpentry 3 2 ≤ 16 hours

Painting 1 1 ≤ 8 hours
Profit per table $50 $54

Let x = number of type-A table

y = number of type-B table.

The Profit to Maximize (in dollars) is given by:

P = 50x + 54y
 Table A (X) Table B (Y)

The constraints are given by: Carpentry 3 2

Carpentry: 3 x + 2 y  16 Painting 1 1
Painting: x+ y 8
Profit per $50 $54
table

Also, the number of tables for Type-A and Type-B are not less than 0:
x  0, y  0
So we have:
 Example to Solve the Linear
programming Problem

Example 1
Maximize the profit function P = x + 1.2 y

Subject to constraints:
x + 3 y  300
2 x + y  180
x  0, y  0

25
Graph the intersection of the solutions to the inequalities:
x + 3 y  300
2 x + y  180
x  0, y  0
x + 3 y  300 2 x + y  180
x + 3y = 300 2x + y = 180
y when x = 0, y = 100 when x = 0, y = 180
180 when y = 0, x = 300 when y = 0, x = 90

100
x + 3 y = 300
S
x
90 300
2 x + y = 180
■ Next, find the vertices of the bounded area.
– The vertices are A(0, 0), B(90, 0), C(48, 84), and D(0,
100).

y
200
D(0, 100)
C(48, 84)
100 x + 3 y = 300
S
A(0, 0) B(90, 0)
x
100 200 300
2 x + y = 180
■ Now, find the values of profit function P at the vertices and
tabulate them:

Vertex P = x + 1.2 y
A(0, 0) 0
y B(90, 0) 90
200 C(48, 84) 148.8
D(0, 100) 120
D(0, 100)
C(48, 84)
100 x + 3 y = 300
S
A(0, 0) B(90, 0)
x
100 200 300
2 x + y = 180
■ Finally, identify the vertex with the highest value for P:
– We can see that P is maximized at the vertex C(48, 84)
and has a value of 148.8.

Vertex P = x + 1.2 y
y A(0, 0) 0
200 B(90, 0) 90
C(48, 84) 148.8
D(0, 100)
D(0, 100) 120
C(48, 84)
100
S x + 3 y = 300
A(0, 0) B(90, 0)
x
100 200 300
2 x + y = 180

We conclude that the profit would be maximized at $148.80 when

x = 48 and y = 84.
 Example 2
A company manufactures two products, A and B, on two machines I
and II.
It has been determined that the company will realize a profit of RM3
per unit of product A and a profit of RM4 per unit of product B.
To manufacture a unit of product A, it requires 6 min on machine I
and 5 min on machine II. To manufacture a unit of product B, it
requires 9 min on machine I and 4 min on machine II.
There are 5 hr (300 min) of machine time available on machine I
and 3 hr (180 min) of machine time available on machine II in each
work shift.
How many units of each product should be produced to maximize
the company’s profits?
Product A Product B Time Available
Machine I 6 9 ≤ 300
5
Machine II 5 4 ≤ 180 3
Profit per unit ($) 3 4
Organize the Information:
Product A Product B Time Available
Machine I 6 9 ≤ 300
Machine II 5 4 ≤ 180
Profit per unit ($) 3 4

Let denotes x = number of units produced for product A

y = number of units produced for product B
Profit is maximized at P = 3x + 4 y
6 x + 9 y  300 (time constraint– Machine I)
Constraints: 5 x + 4 y  180 (time constraint– Machine II)
x  0, y  0 (non-zero constraints)
 We can now solve the problem graphically

Objective: Profit is maximized at P = 3 x + 4 y

Constraints: 5 x + 4 y  180
6 x + 9 y  300 6 x + 9 y  300
y 5 x + 4 y  180 6 x + 9 y = 300
5 x + 4 y = 180
50 when x = 0, y = 45
x  0, y  0 when x = 0, y = 33.3333
when y = 0, x = 36
x when y = 0, x = 50
40 P attains a maximum value of 140 when
D (0,33.3333)
x = y = 20. Thus, by producing 20 units ofVertex
each product, the company
P = 3xwill
+ 4yrealize
30 x an optimal profit of $140. A(0,0) P = 3(0) + 4(0) = 0
B(36,0) P = 3(36) + 4(0) = 108
20 C(20,20) C(20,20) P = 3(20) + 4(20) = 140
D(0,33.3333) P = 3(0) + 4(33.33) =
10 133.3333
B(36,0)
x x x
A (0,0) 10 20 30 40 50
6x + 9y = 300
5x + 4y = 180
Question 1. Solve the given linear programming
problems graphically:
Maximize: Z = 8x + y

and the constraints are :

x + y ≤ 40,
2x + y ≤ 60,
x ≥ 0, y ≥ 0

Answer: Maximum value of Z = 240 at point x = 30, y

= 0.

33
Question 2.

Answer :

34
 Transportation Problem
The structure of transportation problem involves a large
number of shipping routes from several supply centres to
several demand centres. The objective is to determine the
number of units of an item (commodity or product) that should
be shipped from an origin to a destination in order to satisfy
the required quantity of goods or services at each destination
centre.

The study of transportation problem helps to identify optimal

transportation routes along with units of commodity to be
shipped in order to minimize total transportation cost.

35
 MATHEMATICAL MODEL OF TRANSPORTATION
PROBLEM
Example: A company has three production facilities S1, S2 and S3 with
production capacity of 7, 9 and 18 units (in 100s) per week of a product,
respectively. These units are to be shipped to four warehouses D1, D2, D3
and D4 with requirement of 5, 6, 7 and 14 units (in 100s) per week,
respectively. The transportation costs (in rupees) per unit between factories to
warehouses are given in the table below:

Formulate this transportation problem as an LP model to minimize the total

transportation cost.
36
Model formulation Let xij = number of units of the product to be
transported from a production facility i (i = 1, 2, 3) to a warehouse j ( j = 1,
2, 3, 4) The transportation problem is stated as an LP model as follows:
Minimize (total transportation cost)

Z=

37
In the above LP model, there are m × n = 3 × 4 = 12 decision variables,
and m + n = 7 constraints, where m are the number of rows and n are the
number of columns in a general transportation table.

Existence of feasible solution A necessary and sufficient condition for a

feasible solution to the transportation problems is:

Total supply = Total demand

Note 1. When the total supply is equal to the total demand, the problem is
called a balanced transportation problem, otherwise it is called an
unbalanced transportation problem. The unbalanced transportation problem
can be made balanced by adding a dummy supply centre (row) or a dummy
demand centre (column) as the need arises.
38
2. When the number of positive allocations (values of decision variables) at
any stage of the feasible solution is less than the required number (rows +
columns – 1), i.e. number of independent constraint equations, the solution is
said to be degenerate, otherwise non-degenerate. For proof, see Appendix at
the end of this chapter.

3. Cells in the transportation table having positive allocation, i.e., xij > 0 are
called occupied cells, otherwise are known as non-occupied (or empty) cells.

39
 THE TRANSPORTATION ALGORITHM

Step 1: Formulate the problem and arrange the data in the matrix form

Step 2: Obtain an initial basic feasible solution. Following three different

methods are discussed to obtain an initial solution:
• North-West Corner Method,
• Least Cost Method, and
• Vogel’s Approximation (or Penalty) Method

The initial solution obtained by any of the three methods must satisfy the
following conditions:
(i) The solution must be feasible, i.e. it must satisfy all the supply and
demand constraints (also called rim conditions).

(ii) The number of positive allocations must be equal to m + n – 1, where m

is the number of rows and n is the number of columns.

NOTE: Any solution that satisfies the above conditions is called non-
degenerate basic feasible solution, otherwise, degenerate solution.
40
Step 3: Test the initial solution for optimality In this chapter,
the Modified Distribution (MODI) method is discussed to test
the optimality of the solution obtained in Step 2. If the current
solution is optimal, then stop. Otherwise, determine a new
improved solution.

Step 4: Updating the solution Repeat Step 3 until an optimal

solution is reached.

41
 North-West Corner Method (NWCM)

This method does not take into account the cost of transportation on any route of
transportation. The method can be summarized as follows:

Step 1: Start with the cell at the upper left (north-west) corner of the
transportation table (or matrix) and allocate commodity equal to the minimum of
the rim values for the first row and first column, i.e. min (a1, b1).

Step 2: (a) If allocation made in Step 1 is equal to the supply available at first
source (a1, in first row), then move vertically down to the cell (2, 1), i.e., second
row and first column. Apply Step 1 again, for next allocation. (b) If allocation
made in Step 1 is equal to the demand of the first destination (b1 in first column),
then move horizontally to the cell (1, 2), i.e., first row and second column. Apply
Step 1 again for next allocation. (c) If a1 = b1, allocate x11 = a1 or b1 and move
diagonally to the cell (2, 2).

42
Step 3: Continue the procedure step by step till an allocation is made in the
south-east corner cell of the transportation table.

NOTE: If during the process of making allocation at a particular cell, the

supply equals demand, then the next allocation of magnitude zero can be
made in a cell either in the next row or column. This condition is known as
degeneracy.

Example 1: Use North-West Corner Method (NWCM) to find an initial basic

feasible solution to the transportation problem

43
44
45
 Least Cost Method (LCM)

Since the main objective is to minimize the total transportation cost, transport
as much as possible through those routes (cells) where the unit transportation
cost is lowest. This method takes into account the minimum unit cost of
transportation for obtaining the initial solution and can be summarized as
follows:

Step 1: Select the cell with the lowest unit cost in the entire transportation table
and allocate as much as possible to this cell. Then eliminate (line out) that row
or column in which either the supply or demand is fulfilled. If a row and a
column are both satisfied simultaneously, then crossed off either a row or a
column. In case the smallest unit cost cell is not unique, then select the cell
where the maximum allocation can be made.

Step 2: After adjusting the supply and demand for all uncrossed rows and
columns repeat the procedure to select a cell with the next lowest unit cost
among the remaining rows and columns of the transportation table and allocate
as much as possible to this cell. Then crossed off that row and column in
which either supply or demand is exhausted.
46
Step 3: Repeat the procedure until the available supply at various sources and
demand at various destinations is satisfied. The solution so obtained need not
be non-degenerate.

Example 2: Use Least Cost Method (LCM) to find initial basic feasible
solution to the transportation problem

47
48
49
 Vogel’s Approximation Method (VAM)

Vogel’s approximation (penalty or regret) is preferred over NWCR and LCM

methods. In this method, an allocation is made on the basis of the opportunity
(or penalty or extra) cost that would have been incurred if the allocation in
certain cells with minimum unit transportation cost were missed. Hence,
allocations are made in such a way that the penalty cost is minimized. An initial
solution obtained by using this method is nearer to an optimal solution or is the
optimal solution itself. The steps of VAM are as follows:

Step 1: Calculate the penalties for each row (column) by taking the difference
between the smallest and next smallest unit transportation cost in the same row
(column). This difference indicates the penalty or extra cost that has to be paid if
decision-maker fails to allocate to the cell with the minimum unit transportation
cost.

Step 2: Select the row or column with the largest penalty and allocate as much
as possible in the cell that has the least cost in the selected row or column and
satisfies the rim conditions. If there is a tie in the values of penalties, it can be
broken by selecting the cell where the maximum allocation can be made
50
Step 3: Adjust the supply and demand and cross out the satisfied row or
column. If a row and a column are satisfied simultaneously, only one of them
is crossed out and the remaining row (column) is assigned a zero supply
(demand). Any row or column with zero supply or demand should not be used
in computing future penalties.

Step 4: Repeat Steps 1 to 3 until the available supply at various sources and
demand at various destinations is satisfied.

Example 3: Use Vogel’s Approximation Method (VAM) to find the initial basic
feasible solution to the transportation problem

51
52
53
Question 1: A dairy firm has three plants located in a state.
The daily milk production at each plant is as follows:

Plant 1 : 6 million litres,

Plant 2 : 1 million litres, and
Plant 3 : 10 million litres Each day, the firm must fulfil the needs of its four
distribution centres.

The minimum requirement of each centre is as follows:

Distribution centre 1 : 7 million litres,

Distribution centre 2 : 5 million litres,
Distribution centre 3 : 3 million litres, and
Distribution centre 4 : 2 million litres

Cost (in hundreds of rupees) of shipping one million litre from each plant to
each distribution centre is given in the following table:

54
Solution: North-West Corner Rule : Rs. 11,600

Least Cost Method : Rs. 11,200

Vogel’s Approximation Method : Rs. 10,200

55
Question 2:

Solution:

56
 Assignment Problem
■ An assignment problem is a particular case of a transportation problem
where the given resources are allocated to an equal number of activities
with an aim of either minimizing total cost, distance, time or maximizing
profit. Travelling salesman is a specific application of assignment model.

■ The problem of assignment arises because the resources that are

available such as men, machines, etc., have varying degree of efficiency
for performing different activities. Therefore, the cost, profit or time of
performing different activities is also different. Thus, the problem becomes:
How should the assignments be made in order to optimize the given
objective.

■ Assignment table is a convenient way to summarize available data.

57
 MATHEMATICAL MODEL OF ASSIGNMENT
PROBLEM

The general data matrix for assignment problem is shown in Table . It may be noted that
this data matrix is the same as the transportation cost matrix except that the supply (or
availability) of each of the resources and the demand at each of the destinations is taken
to be one. It is due to this fact that assignments are made on a one-to-one basis.

58
SOLUTION METHODS OF ASSIGNMENT PROBLEM

An assignment problem can be solved by any of the following methods:

■ Enumeration method
■ Simplex method
■ Transportation method
■ Hungarian method

59
 Hungarian Method for Solving Assignment
Problem

The Hungarian method (minimization case) can be summarized in the following steps:
Step 1: Develop the cost matrix from the given problem If the number of
rows are not equal to the number of columns, then add required number of dummy
rows or columns. The cost element in dummy rows/columns are always zero.
Step 2: Find the opportunity cost matrix
(a) Identify the smallest element in each row of cost matrix and then subtract it from
each element of that row, and
(b) In the reduced matrix obtained from 2(a), identify the smallest element in each
column and then subtract it from each element of that column. Each row and column
now have at least one zero element.
Step 3: Make assignments in the opportunity cost matrix The procedure of
making assignments is as follows:

60
(a) First round for making assignments
Identify rows successively from top to bottom until a row with exactly one zero
element is found. Make an assignment to this single zero by making a square ()
around it. Then cross off (×) all other zeros in the corresponding column.
Identify columns successively from left to right hand with exactly one zero
element that has not been assigned. Make assignment to this single zero by making a
square () around it and then cross off (×) all other zero elements in the
corresponding row.

(b) Second round for making assignments

If a row and/or column has two or more unmarked zeros and one cannot be
chosen by inspection, then choose zero element arbitrarily for assignment.

Repeat steps (a) and (b) successively until one of the following situations arise.

61
62
63
Example 1: A computer centre has three expert programmers. The
centre wants three application programmes to be developed. The head
of the computer centre, after carefully studying the programmes to be
developed, estimates the computer time in minutes required by the
experts for the application programmes as follows:

Assign the programmers to the programmes in such a way that the

total computer time is minimum.

Solution: Steps 1 and 2 The minimum time element in rows 1, 2 and 3 is 80, 80
and 110, respectively.
Subtract these elements from all elements in their respective row. The reduced time
matrix is shown in Table 64
65
66
Example 2 : A department of a company has five employees with five jobs to be
performed. The time (in hours) that each man takes to perform each job is given
in the effectiveness matrix.

How should the jobs be allocated, one per employee, so as to minimize

the total man-hours?

Solution : Applying Step 2 of Hungarian algorithm, the reduced

opportunity time matrix is shown in Table

67
68
69
70
Question 1:

Solution :

71
 Graphical method

Question 1 : Use the graphical method to solve the following LP problem.

Answer :

Question 2 : Use the graphical method to solve the following LP problem.

Answer :

Question 3 : A company produces two types of leather belts, A and B. Belt A is of a

superior quality and B is of an inferior quality. The profit from the two are 40 and 30 paise
per belt, respectively. Each belt of type A requires twice as much time as required by a belt
of type B. If all the belts were of type B, the company could produce 1,000 belts per day. But
the supply of leather is sufficient only for 800 belts per day. Belt A requires a fancy buckle
and only 400 of them are available per day. For belt B only 700 buckles are available per
day. Solve this problem to determine how many units of the two types of belts the company
should manufacture in order to have the maximum overall profit?

Answer :
Question 4 : A furniture manufacturer makes two products: chairs and tables. These
products are processed using two machines A and B. A chair requires 2 hours on machine A
and 6 hours on machine B. A table requires 5 hours on machine A and no time on machine
B. There are 16 hours per day available on machine A and 30 hours on machine B. The
profit gained by the manufacturer from a chair is Rs 2 and from a table is Rs 10. Solve this
problem to find the daily production of each of the two products.

Answer :

Question 5 : Use the graphical method to solve the following LP problem.

Answer :
 Least Cost Method (LCM)

Since the main objective is to minimize the total transportation cost, transport
as much as possible through those routes (cells) where the unit transportation
cost is lowest. This method takes into account the minimum unit cost of
transportation for obtaining the initial solution and can be summarized as
follows:

Step 1: Select the cell with the lowest unit cost in the entire transportation table
and allocate as much as possible to this cell. Then eliminate (line out) that row
or column in which either the supply or demand is fulfilled. If a row and a
column are both satisfied simultaneously, then crossed off either a row or a
column. In case the smallest unit cost cell is not unique, then select the cell
where the maximum allocation can be made.

Step 2: After adjusting the supply and demand for all uncrossed rows and
columns repeat the procedure to select a cell with the next lowest unit cost
among the remaining rows and columns of the transportation table and allocate
as much as possible to this cell. Then crossed off that row and column in
which either supply or demand is exhausted.
46
Step 3: Repeat the procedure until the available supply at various sources and
demand at various destinations is satisfied. The solution so obtained need not
be non-degenerate.

Example 2: Use Least Cost Method (LCM) to find initial basic feasible
solution to the transportation problem

47
48
49
 Vogel’s Approximation Method (VAM)

Vogel’s approximation (penalty or regret) is preferred over NWCR and LCM

methods. In this method, an allocation is made on the basis of the opportunity
(or penalty or extra) cost that would have been incurred if the allocation in
certain cells with minimum unit transportation cost were missed. Hence,
allocations are made in such a way that the penalty cost is minimized. An initial
solution obtained by using this method is nearer to an optimal solution or is the
optimal solution itself. The steps of VAM are as follows:

Step 1: Calculate the penalties for each row (column) by taking the difference
between the smallest and next smallest unit transportation cost in the same row
(column). This difference indicates the penalty or extra cost that has to be paid if
decision-maker fails to allocate to the cell with the minimum unit transportation
cost.

Step 2: Select the row or column with the largest penalty and allocate as much
as possible in the cell that has the least cost in the selected row or column and
satisfies the rim conditions. If there is a tie in the values of penalties, it can be
broken by selecting the cell where the maximum allocation can be made
50
Step 3: Adjust the supply and demand and cross out the satisfied row or
column. If a row and a column are satisfied simultaneously, only one of them
is crossed out and the remaining row (column) is assigned a zero supply
(demand). Any row or column with zero supply or demand should not be used
in computing future penalties.

Step 4: Repeat Steps 1 to 3 until the available supply at various sources and
demand at various destinations is satisfied.

Example 3: Use Vogel’s Approximation Method (VAM) to find the initial basic
feasible solution to the transportation problem

51
52
53
Question 1: A dairy firm has three plants located in a state.
The daily milk production at each plant is as follows:

Plant 1 : 6 million litres,

Plant 2 : 1 million litres, and
Plant 3 : 10 million litres Each day, the firm must fulfil the needs of its four
distribution centres.

The minimum requirement of each centre is as follows:

Distribution centre 1 : 7 million litres,

Distribution centre 2 : 5 million litres,
Distribution centre 3 : 3 million litres, and
Distribution centre 4 : 2 million litres

Cost (in hundreds of rupees) of shipping one million litre from each plant to
each distribution centre is given in the following table:

54
Solution: North-West Corner Rule : Rs. 11,600

Least Cost Method : Rs. 11,200

Vogel’s Approximation Method : Rs. 10,200

55
Question 2:

Solution:

56
 Extra questions
I
Variable separable

1. Solve the following differential equation:

Solution:
 2. Solve the following differential equation:

Solution:

3. Solve the following differential equation:

Solution:
 II
Homogeneous equations

1.

Solution:

2.

Solution:
 3.

Solution:
 4.

Solution: