Management Science (4102)

Safwan 27th Batch

 Management Science (4102)

Mid 1 Solution (Mazhar Sir)

1. Management science is an interdisciplinary field that uses analytical methods &

quantitative techniques to solve complex problems management problems and improve
organizational decision-making. It applies mathematical models, statistical analysis,
optimization techniques and strategic planning in various areas of business. The key aspects
of management science are the following:

I. Problem identification: Understanding the challenges faced by an organization, such as

inefficiencies, resource allocation, or decision-making complexities
II. Quantitative Models: Developing mathematical or statistical models for real-world
business problems, such as linear programming, network models, and forecasting
techniques.
III. Optimization: Finding the best possible decision-making solutions, such as minimizing
cost or maximizing profit.
IV. Data analysis & Forecasting: Using data to analyze trends, predict future outcomes, and
support decision-making processes.
V. Simulation & Risk Analysis: Modeling different scenarios to assess risks and the impact
of various decisions on organizational performance.

2. (a) Linear programming deals with the optimization of a function of variables known as
objective function, subject to set of linear equalities/inequalities known as constraints. The
objective function may be profit, loss, cost or any other measure of effectiveness which is to
be obtained in the best possible or optimal manner. The constraints may be imposed by
different source like market demand, production process raw material availability etc.

Linear programming is used for optimization problems that satisfy the following conditions:

I. There is a well-defined objective function to be optimized which can be expressed as a

linear function of decision variables
II. There are constraints on the attainment of the objective and they are capable of being
expressed as linear equalities/inequalities in terms of variables.
III. There are alternative courses of action.

Safwan 27th Batch

 Management Science (4102)

IV. The decision variables are interrelated and nonnegative.

V. Resources are in limited supply.

2. (b) Step5

Step1 Constraints are,

The key decision is to determine the For A 2x 1 + 3x 2 + 7 x 3 ≥ 1250

amount of grains used as feed for his
For B, x 1 + x 2 ≥ 250
livestock at the minimum cost.
For C, 5x 1 + 4x 3 ≥ 900
Step2
For D, 7x 1 + 22x 2 + 2x 3 ≥ 1232, where
Let x 1 , x 2 , & x 3 be represented as the
x1, x2, x3 ≥ 0
amount of Grain 1, Grain 2, and Grain 3.
The complete linear programming
Step3
problem is then given by
Feasible alternatives are sets of values of
minimize Z = 41x 1 + 35x 2 + 96x 3
x1, x2, & x3.
Subject to 2x 1 + 3x 2 + 7 x 3 ≥ 1250
Where x 1 , x 2 , & x 3 ≥ 0
x 1 + x 2 ≥ 250
Step4
5x 1 + 4x 3 ≥ 900
Objective function,
7x 1 + 22x 2 + 2x 3 ≥ 1232,
minimize Z = 41x 1 + 35x 2 + 96x 3
where x 1 , x 2 , x 3 ≥

3. Here, maximize Z = 2x 1 + x 2

Subject to x1 + 2x 2 ≤ 10

x1 + x2 ≤ 6

x1 – x2 ≤ 2

x 1 – 2x 2 ≤ 1

x1, x2 ≥ 0

Safwan 27th Batch

Management Science (4102)

Now, x1 – x2 = 2

x1 + 2x 2 = 10 X1 0 2

X1 0 10 x2 -2 0

x2 5 0

x 1 – 2x 2 = 1

x1 + x2 = 6 X1 0 1

X1 0 6 1
x2 − 0
2
x2 6 0

7 X2

6
A
5
B (2, -2)
4

3
(1, -1/2)
Feasible Area C
2

1
D
0F
(10, 5)
X1
0
E 2 4 6
(6, 6)
8 10 12
-1

-2

-3

For A, the corresponding equation is→

x1 + 2x 2 = 10, then the feasible point will be, x1, x2 = (0, 5).

For B, the corresponding equations are→

Safwan 27th Batch

Management Science (4102)

x1 + 2x 2 = 10 & x 1 + x 2 = 6, after solving the equation we get,

x1, x2 = 2, 4

For C, the corresponding equations are→

x 1 - x 2 = 2 & x 1 + x 2 = 6, after solving the equation we get,

x1, x2 = 4, 2

For D, the corresponding equations are→

x 1 - x 2 = 2 & x1 - 2x 2 = 1, after solving the equation we get,

x1, x2 = 3, 1

For E, the corresponding equation is→

x1 - 2x 2 = 1, then the feasible point will be, x1, x2 = (1, 0).

For F, x1, x2 = (0, 0).

The values of Z, at these points, are given below→

Extreme point maximize Z = 2x1 + x2

F (0, 0) 0
A (0, 5) 5
B (2, 4) 8
C (4, 2) 10
D (3, 1) 7
E (1, 0) 2

Hence, the maximum Z occurs at the points C (4, 2) and it is 10.

Safwan 27th Batch

Management Science (4102)

Safwan 27th Batch

 Management Science (4102)

Mid 2 Solution

1.

Maximize Z=2x1 + 3x2 + 4x3 + 7x4

Constraints:
2x1 + 3x2 − x3 + 4x4 = 8
x1 − 2x2 + 6x3 − 7x4 = −3
Is the
Is the
S. no. of Values of the basic Value of solution Is the
Non- solution
the Basic variables given by the non- solution
basic feasible?
basic variables the constraint objective degenerate? feasible and
variables (are all Xj
solution equations function (are all basic optimal?
≥ 0)
> 0?)

2x1 + 3x2 = 8
1 x1 ,x2 x3 ,x4 x1 − 2x2 = −3 8 Yes Yes Yes
x1 = 1 ; x 2 = 2

2x1 − x3 = 8
x1 + 6x3 = −3
2 x1 ,x3 x2 ,x4 34/13 No No No
x1 = 45/13 ; x3 = -
14/13
2x1 + 4x4 = 8
3 x1 ,x4 x2 ,x3 x1 − 7x4 = −3 31/3 Yes Yes Yes
x1 = 22/9; x4 = 7/9
3x2 − x3 = 8
4 x2 ,x3 x1 ,x4 − 2x2 + 6x3 = −3 163/16 Yes Yes Yes
x2 = 45/16; x3 = 7/16
3x2 + 4x4 = 8
− 2x2 − 7x4 = −3
5 x2 ,x4 x1 ,x3 83/13 No No No
x2 = 44/13; x4 = -
7/13
− x3 + 4x4 = 8
6x3 − 7x4 = −3 Yes
6 x3 ,x4 x1 ,x2 491/17 Yes Yes
x3 = 44/17; x4 = (Maximized)
45/17

Safwan 27th Batch

Management Science (4102)

2.

Table 1 Table 4
1 2 3 4 1 3
70 20 50 50
A 250 300/50 (30) ← A 70
50
50
30
50 (20)

B
40 40 60 50
150 (0)
C
100
100/0 (20) ←
D 40 40 50 (0)
50 30 30 20
C 100 (10)
50 150/50
40 10 40 20 (10) (10)
D 200 (10)

200 250/0 150 150 Table 5

1 3
(0) (10) (10) (0)
70 50
A 50/0 (20)
50
Table 2 D
40 40
50/0 (0)
1 3 4 50
70 50 50 50/0 50/0
A 50 (0)
40 60 50 (30) (10)
B 150 (10)
C 50 30 20 100 (10) ↑
40 40 20
D
150
200/50 (20) ←
200 150 150/0
So the solution is :
(0) (10) (0)

Table 3 xA2 250 CA2 5000

1 3
A 70 50 50 (20)
xA3 50 CA3 2500

B
40 60
150/0 (20) ← xB1 150 CB1 6000
150
C 50 30 100 (20) xC3 100 CC3 3000
D 40 40 50 (0)
xD1 50 CD1 2000
200/50 150
(0) (10) xD4 150 CD4 3000
21500

Safwan 27th Batch

Management Science (4102)
3.

I II III IV V
A 15 10 14 23 16
B 18 14 11 17 19
C 8 7 9 9 10
D 23 14 17 22 20
E 16 11 19 24 15
Table 1
Table 4
I II III IV V
I II III IV V
A 5 0 4 13 6
A 1 0 1 8 0 ✔
B 7 3 0 6 8
B 6 6 0 4 5 ✔
C 1 0 2 2 3
C 0 3 2 0 0
D 9 0 3 8 6
D 5 0 0 3 0 ✔
E 5 0 8 13 4
E 3 2 7 10 0 ✔
✔ ✔ ✔
Table 2 Table 5
I II III IV V I II III IV V
A 4 0 4 11 3 ✔ A 0 0 1 7 0
B 6 3 0 4 5 B 5 6 0 3 5
C 0 0 2 0 0 C 0 4 3 0 1
D 8 0 3 6 3 ✔ D 4 0 0 2 0
E 4 0 8 11 1 ✔ E 2 2 7 9 0
✔
Table 3
Jobs are allocated to the machines in the following
I II III IV V
A 3 0 3 10 2 ✔ way→ AI, DII, BIII, CIV, EV.
B 6 4 0 4 5 So, the minimized costs:
C 0 1 2 0 0
D 7 0 2 5 2 ✔ 15 + 14 + 11 + 9 + 15 = 6
E 3 0 7 10 0
✔

4.

Maximize Z = 2x1 + x2
Safwan 27th Batch
Management Science (4102)

Subject to 4x1 + 3x2 ≤ 12

4x1 + x2 ≤ 8
4x1 - x2 ≤ 4
x 1, x 2 ≥ 0
Introduce slack variables, the problem can be expressed in standard form

Z = 2x1 + x2 + 0s1 + 0s2 + 0s3

Subject to
4x1 + 3x2 + s1+0s2+0s3 = 12
4x1 + x2 + 0s1 + s2 + 0s3 = 8
4x1 - x2 + 0s1+ 0s2 + s3 = 4
x1 ,x2 ,s1,s2 ,s3 ≥ 0
Setting decision variables x, y, z each equal to zero, the basic (non-degenerable)
feasible solution

x 1 = x2 = 0
s1 = 12; s2 = 8; s3 =4 (Basic)
Z=0
Table 1
Cj 2 1 0 0 0
CB Basis x1 x2 s1 s2 s3 b Θ
0 s1 4 3 1 0 0 12 3
0 s2 4 1 0 1 0 8 2
0 s3 (4) -1 0 0 1 4 1 ←
Ej = Σ CB*aij 0 0 0 0 0 0
C j - Ej 2 1 0 0 0

Table 2
CB Basis x1 x2 s1 s2 s3 b
0 s1 4 3 1 0 0 12
0 s2 4 1 0 1 0 8
0 s3 1 - 1/4 0 0 1/4 1

Safwan 27th Batch

Management Science (4102)

Table 3
Cj 2 1 0 0 0
CB Basis x1 x2 s1 s2 s3 b Θ
0 s1 0 (4) 1 0 -1 8 2 ←
0 s2 0 2 0 1 -1 4 2
2 x1 1 - 1/4 0 0 1/4 1 -4
Ej = Σ CB*aij 2 -0.5 0 0 1/2 2
Cj - Ej 0 1 1/2 0 0 - 1/2

↑
Table 4
CB Basis x1 x2 s1 s2 s3 b
0 s1 0 1 1/4 0 -1/4 2
0 s2 0 2 0 1 -1 4
2 x1 1 - 1/4 0 0 1/4 1

Table 5
Cj 2 1 0 0 0
CB Basis x1 x2 s1 s2 s3 b
1 x2 0 1 1/4 0 -1/4 2
0 s2 0 0 - 1/2 0 -1/4 0
2 x1 1 0 1/16 0 3/16 3/2
Ej = Σ CB*aij 2 1 3/8 0 1/8 5
Cj - Ej 0 0 - 3/8 0 - 1/8

So the basic feasible solution is 3

Zmax = 2 × + 2 = 5
2
x1 = 3/2
Here, in table 3, one can choose the
x2 = 2 second row as a pivot row, which also
results in the same solution.

Safwan 27th Batch