TRIBHUVAN UNIVERSITY

Institute of Engineering
Pulchowk Campus

An Assignment On

Operational Research

Submitted by: Submitted to:

Ajeya Acharya Dr. Jagat Shrestha
073MSTR252 Class Teacher

Submission Date: 2017/12/20

Assignment 1

3.1-1. for each of the following constraints, draw a separate graph to show the nonnegative solutions
that satisfy this constraint.
(a) x1 + 3x2 <= 6
(b) 4x1 + 3x2<= 12
(c) 4x1 + x2 <= 8
(d)Now combine these constraints into a single graph to show the feasible region for the entire set of
functional constraints plus no negativity constraints.

Solution:
For x1+3x2<=6,
Taking boundary condition x1+3x2=6 (i)

For 4x1+x2<=8,
Boundary condition: 4x1+x2=8 (ii)

Solving (i) and (ii)

We get x1=16/11
X2=18/11
⇒(x1,x2)= (16/11,18/11)

Ajeya Acharya 1
073MSTR252
Assignment 1

Question No. 3.1.1 Solution

x y
0 6 EQN-1
1 3
eqn-1
2 0
7
6
5
4
3
x1= 6-3x2
2
1
0
0 0.5 1 1.5 2 2.5

x y
0 3 EQN-2
1 2.25 eqn-2
2 1.5
3.5
3 0.75
4 0 3
2.5
2
1.5 4x1+3x2=12
1
0.5
0
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5
x y
0 2
1 1.75 EQN-3
2 1.5
3 1.25 eqn-3

4 1 2.5
5 0.75
6 0.5 2

7 0.25
1.5
8 0
1 4x1+x2=8

0.5

0
0 1 2 3 4 5 6 7 8 9

Ajeya Acharya 2
073MSTR252
 Assignment 1

COMBINED GRAPH
eqn-3 eqn-1 eqn-2

0
0 1 2 3 4 5 6 7 8 9

feasible region

Ajeya Acharya 3
073MSTR252
Assignment 1

3.1-6. The Whitt Window Company is a company with only three employees, which makes two
different kinds of handcrafted windows: a wood-framed and an aluminum-framed window. They earn
$60 profit for each wood-framed window and $30 profit for each aluminum-framed window. Doug
makes the wood frames, and can make 6 per day. Linda makes the aluminum frames, and can make 4
per day. Bob forms and cuts the glass, and can make 48 square feet of glass per day. Each wood-
framed window uses 6 square feet of glass and each aluminum-framed window uses 8 square feet of
Glass. The company wishes to determine how many windows of each type to produce per day to
maximize total profit.
(a) Describe the analogy between this problem and the Wyndor Glass Co. problem discussed in Sec.
3.1. Then construct and fill in a table like Table 3.1 for this problem, identifying both the activities and
the resources.
(b) Formulate a linear programming model for this problem.
(c) Use the graphical model to solve this model.
(d) A new competitor in town has started making wood-framed windows as well. This may force the
company to lower the price they charge and so lower the profit made for each wood framed window.
How would the optimal solution change (if at all) if the profit per wood-framed window decreases
from $60 to $40? From $60 to $20?
(e) Doug is considering lowering his working hours, which would decrease the number of wood frames
he makes per day. How would the optimal solution change if he makes only 5 wood frames per day?

(a)
The question is analogous to Prototype example 3.1. As in example, this question has three employees
analogous to three plants in example. The capacity of each person is limited similar as the capacity of
machines is fixed in the example. The production of wood framed window is dependent on capacity
of Doug and bob analogous to Plant 1 and Plant 3 in example. The production of aluminum frame
window depend upon capacity of Linda and bob analogous to Plant 2 and Plant 3 in example.

Data for Whitt window Company

Glass required per window (sq. ft.)
Employer Product1 Product 2 Available glass per day
Wood frame Aluminium (sq. ft.)
Doug 6 0 36
Linda 0 8 32
Bob 6 8 48
Profit per piece $60 $30

(b)
Let, W=no of wood frame window produced per day
A= no of aluminum frame window produced per day

Then,
w≤6, a≤4
6w+8a≤48
w≥0
a≥0
Subjected to:
Z =60w+30a

Ajeya Acharya 4
073MSTR252
Assignment 1

(c) The corner points of solutions (a,w) are:

0, 6), (1.5, 6), (4, 2.66), (4, 0) and (0,0)

To maximize profit:
Z1=30*0+60*6=$360
Z2=$390
Z3=$300
Z4=$120
Z5=$0

Hence, optimal solution is to produce 1 aluminum frame window and 6 window frame windows.

(d) If the profit of wood decreases from $60 to $40,

Z=40+30a
Z1=$240
Z2=$270
Z3=$220
Z4=$120
Z5=$0
Optimal solution remains same

If Profit of wood frame decreases from $60 to $20

Z= 20w+30a
Z1=$120
Z2=$150
Z3=$140
Z4=$120
Z5=$0
Still Optimal solution does not change.

(e) Change in constraint w≤5

Feasible solution are (0,5), (2.25,5), (4,2.66), (4,0) and (0,0)
Z1=$300
Z2=$360
Z3=$300
Z4=$120
Z5=$0
Hence Optimal Solution is to produce 5 wood frame window and 2 aluminum frame window.

Ajeya Acharya 5
073MSTR252
 Q. No. 3.1.6 w a
0 6
eqn-1 w<=6 1 5.25
Assignment 1

073MSTR252
Ajeya Acharya
2 4.5
eqn-2 a<=4 3 3.75
4 3
eqn-3 6w+8a<=48 5 2.25
6 1.5
7 0.75
8 0

wood aluminium wood and alminium x axis y axis

WOOD
4

0
0 1 2 3 4 5 6 7
ALUMINIUM

6
Assignment 1

3.1-8. The WorldLight Company produces two light fixtures (products 1 and 2) that require both metal
frame parts and electrical components. Management wants to determine how many units of each
product to produce to maximize profit. For each unit of product 1, 1 unit of frame parts and 2 units of
electrical components are required. For each unit of product 2, 3 units of frame parts and 2 units of
electrical components are required. The company has 200 units of frame parts and 300 units of
electrical components. Each unit of product 1 gives a profit of $1, and each unit of product 2, up to 60
units, gives a profit of $2. Any excess over 60 units of product 2 brings no profit, so such an excess has
been ruled out.
(a) Formulate a linear programming model for this problem.
(b) Use the graphical method to solve this model. What is the resulting total profit?

Solution:
x=no of product 1
y=no of product 2
Constraints:
x+3y<=20
2x+2y<=300
y<=60
x>=0, y>=0
Subjected to: Z=x+2y
Boundary equations are:
x+3y=20 (i)
x+y=150 (ii)
y=60 (iii)
x=0 (iv)
y=0 (v)

Solve (i) and (ii)

x=125
and y=25

Hence the corner points are: (0,0), (0,60), (125,25) and (150, 0).
Z1=$0
Z2=$120
Z3=$140
Z4=$175
Z5=$150

From graph, the most feasible solution is to produce 125 no of product 1 and 25 no of product 2.

Ajeya Acharya 7
073MSTR252
 Assignment 1

Qun 3.1.8

x y x y
70
20 60 90 60
26 58 95 55
32 56 100 50
(0,60) (20,60)
60 38 54 105 45
44 52 110 40
50 50 115 35
56 48 120 30
50 62 46 125 25
68 44 130 20
74 42 135 15
80 40 140 10
40 86 38 145 5
92 36 150 0 eqn-1
98 34
eqn-2
104 32
30 110 30 eqn-3
116 28
122 26 (125,25)
128 24
20 feasible region

10

(150,0)
0 (0,0)
0 20 40 60 80 100 120 140 160

Ajeya Acharya 8
073MSTR252
Assignment 1

3.2-6. Suppose that the following constraints have been provided for a linear programming model.
-x1 + 3x2 ≤ 30
-3x1 + x2 ≤ 30
And x1 ≥ 0, x2 ≥ 0.
(a) Demonstrate that the feasible region is unbounded.
(b) If the objective is to maximize Z=-x1 +x2, does the model have an optimal solution? If so, find it. If
not, explain why not.
(c) Repeat part (b) when the objective is to maximize Z =x1-x2.
(d) For objective functions where this model has no optimal solution, does this mean that there are
no good solutions according to the model? Explain. What probably went wrong when formulating the
model?

Solution:
The boundary equation are:
-x1 + 3x2 =30 (i)
-3x1 + x2 = 30 (ii)
x1 = 0 (iii)
x2 = 0 (iv)

a) From graph it is clear that solution is unbound.

b) Maximize Z=-x1+x2
yes optimal solution is (0,10) and Z=10

c) Maximize Z=x1-x2
No, the objective function value is maximum by sliding the objective function line to the right. This can
be done forever. Thus there is no optimal solution,

Ajeya Acharya 9
073MSTR252
 Assignment 1
Qun 3.2.6

COMBINED GRAPH
eqn-1 eqn-2 eqn-3 eqn-4

70

60

50

40

30

20

unbound
10

0
-50 -40 -30 -20 -10 0 10 20 30 40 50 60
-10

Ajeya Acharya 10
073MSTR252
Assignment 1

3.4-7. Ralph Edmund loves steaks and potatoes. Therefore, he has decided to go on a steady diet of
only these two foods (plus some liquids and vitamin supplements) for all his meals. Ralph realizes that
this is not the healthiest diet, so he wants to make sure that he eats the right quantities of the two
foods to satisfy some key nutritional requirements. He has obtained the following nutritional and cost
information:
Ralph wishes to determine the number of daily servings (may be fractional) of steak and potatoes that
will meet these requirements at a minimum cost.
(a) Formulate a linear programming model for this problem.
(b) Use the graphical method to solve this model.
(c) Use a computer to solve this model by the simplex method.

X= daily serving of steak

Y= daily serving of potato

5x+15y>=50
20x+5y>=40
15x+2y<=60
z>=0
y>=0

minimization of 4x+2y
points are: (0,8), (0,30), (1.27,2.9), (3.72,2.09)

Z1=$16
Z2=$60
Z3=$10.88
Z4=$19.06
Hence optimal solution is 1.27 serving of steak and 2.9 serving of potato.

Ajeya Acharya 11
073MSTR252
 Assignment 1

Qun 3.4.7

COMBINED GRAPH
eqn-2 eqn-1 eqn-3 eqn-4 eqn-5

40

35

30 (0,30)

25

20
feasible region
15

(0,8)10

5
(3.72,2.09)
0
-15 -10 -5 (1.27,2.9) 0 5 10 15 20
-5

-10

Ajeya Acharya 12
073MSTR252
 Assignment 1

Question no. 3.6.1

Ingrident steak potatoes

No to make 1.272727 2.909091

Resource used
Carbo 5 15 50 >= 50
protein 20 5 40 >= 40
fat 15 2 24.90909 <= 60
total
Z $ 4.00 $ 2.00 $ 10.91

Ajeya Acharya 13
073MSTR252
 Assignment 1

Microsoft Excel 16.0 Answer Report

Worksheet: [JKS SIR HOMEWORK1.xlsx]3.4.7
Report Created: 1/2/2018 12:09:14 AM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 2 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$E$11Z total $ 8.00 $ 10.91

Variable Cells
Cell Name Original Value Final Value Integer
$C$4 No to make steak 2 1.272727273 Contin
$D$4 No to make potatoes 0 2.909090909 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$E$7 Carbo used 50 $E$7>=$G$7 Binding 0
$E$8 protein used 40 $E$8>=$G$8 Binding 0
$E$9 fat used 24.90909091 $E$9<=$G$9 Not Binding 35.09090909

Ajeya Acharya 14
073MSTR252
Assignment 1

3.6.1 You are given the following data for a linear programming problem where the objective is to
maximize the profit from allocating three resources to two nonnegative activities.
(a) Formulate a linear programming model for this problem.
(b) Use the graphical method to solve this model.
(c) Display the model on an Excel spreadsheet.
(d) Use the spreadsheet to check the following solutions:
(x1, x2) = (2, 2), (3, 3), (2, 4), (4, 2), (3, 4), (4,3).
Which of these solutions are feasible? Which of these feasible solutions has the best value of the
objective function?
(e) Use the Excel Solver to solve the model by the simplex method.

Activity 1: x
Activity 2: y
Constraints:
2x+y≤10 (i)
3x+3y≤20 (ii)
2x+4y≤20 (iii)
x≥0 (iv)
y≥0 (v)

Objective function: Z=20x+30y

Solving (i) and (ii), (i)and (iii) & (ii) and (iii)
(x,y)=(3.33,3.33)
Boundary points: (0,0), (5,0), (3.33,3.33), (0,5).
Z1=$0
Z2=$100
Z3=$166.67
Z4=$150
Thus, optimal solution (x,y)=(3.33,3.33) and Z= $166.67

d) solution: Here,
Feasible solutions are (x, y) = (2, 2), (3, 3), (2, 4), (4, 2)
Non Feasible solutions are (x, y) =(3, 4), (4,3)

Ajeya Acharya 15
073MSTR252
Question:3.6.1
Assignment 1

EQN-1 EQN-2 EQN-3

X Y X Y X Y
0 10 0 6.67 0 5
1 8 1 5.67 2 4
2 6 2 4.67 4 3
3 4 3 3.67 6 2
4 2 4 2.67 8 1
5 0 5 1.67 10 0
6 0.67

EQN-1 EQN-2 EQN-3

12

10

0
0 2 4 6 8 10 12

Ajeya Acharya 16
073MSTR252
 Assignment 1

Question no. 3.6.1

Activity 1 2
No to make 3.333333 3.333333

Resource used
1 2 1 10 <= 10
2 3 3 20 <= 20
3 2 4 20 <= 20
total
Z 20 30 $ 166.67

Ajeya Acharya 17
073MSTR252
Assignment 1

Microsoft Excel 16.0 Answer Report

Worksheet: [JKS SIR HOMEWORK1.xlsx]Sheet1
Report Created: 1/1/2018 11:29:54 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 2 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%,
Assume NonNegative.

Objective Cell (Max)

Cell Name Original Value Final Value
$E$11Z total $ - $ 166.67

Variable Cells
Cell Name Original Value Final Value Integer
$C$4 No to make 0 3.333333333 Contin
$D$4 No to make 0 3.333333333 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$E$7 used 10 $E$7<=$G$7 Binding 0
$E$8 used 20 $E$8<=$G$8 Binding 0
$E$9 used 20 $E$9<=$G$9 Binding 0

Ajeya Acharya 18
073MSTR252
 Assignment 1

Microsoft Excel 16.0 Sensitivity Report

Worksheet: [JKS SIR HOMEWORK1.xlsx]Sheet1
Report Created: 1/1/2018 11:29:55 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$C$4 No to make 3.333333333 0 20 10 5
$D$4 No to make 3.333333333 0 30 10 10

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$E$7 used 10 0 10 1E+30 0
$E$8 used 20 3.333333333 20 0 5
$E$9 used 20 5 20 6.666666667 0

Ajeya Acharya 19
073MSTR252
 Assignment 1

Microsoft Excel 16.0 Limits Report

Worksheet: [JKS SIR HOMEWORK1.xlsx]Sheet1
Report Created: 1/1/2018 11:29:55 PM

Objective
Cell Name Value
$E$11 Z total $ 166.67

Variable Lower Objective Upper Objective

Cell Name Value Limit Result Limit Result
$C$4 No to make 3.333333333 0 100 3.333333333 166.67
$D$4 No to make 3.333333333 0 66.67 3.333333333 166.67

Ajeya Acharya 20
073MSTR252
Assignment 1

3.6.4 Fred Jonasson manages a family-owned farm. To supplement several food products grown on
the farm, Fred also raises pigs for market. He now wishes to determine the quantities of the available
types of feed (corn, tankage, and alfalfa) that should be given to each pig. Since pigs will eat any mix
of these feed types, the objective is to determine which mix will meet certain nutritional requirements
at a minimum cost. The number of units of each type of basic nutritional ingredient contained within
a kilogram of each feed type is given in the following table, along with the daily nutritional
requirements and feed costs:

(a) Formulate a linear programming model for this problem.

(b) Display the model on an Excel spreadsheet.
(c) Use the spreadsheet to check if (x1, x2, x3) =(1, 2, 2) is a feasible solution and, if so, what the daily
cost would be for this diet. How many units of each nutritional ingredient would this diet provide
daily?
(d) Take a few minutes to use a trial-and-error approach with the spreadsheet to develop your best
guess for the optimal solution. What is the daily cost for your solution?
(e) Use the Excel Solver to solve the model by the simplex method.

(a)
x: kg requirement of corn
y: kg requirement of tankage
z: kg requirement of corn alfalfa
90x+80y+40z≥200
30x+80y+60z≥180
10x+20y+60z≥150
x,y,z≥0

Minimize Objective Function: 84x+72y+60z

b) and e) in spread sheet
c) (1,2,2) is feasible solution with daily cost of $348. This diet will provide 210 kg carbohydrate, 310 kg
proteins and 170 kg vitamins daily.

d) The solution vary.

Ajeya Acharya 21
073MSTR252
 Assignment 1

qun no 3.6.4

corn tankage alfalfa

kilogram 1.142857 0 2.428571

Nutrition used
Carbohy 90 20 40 200 >= 200
proteins 30 80 60 180 >= 180
vitamins 10 20 60 157.1429 >= 150
total
Z 84 72 60 241.7143

Ajeya Acharya 22
073MSTR252
 Assignment 1

Microsoft Excel 16.0 Answer Report

Worksheet: [JKS SIR HOMEWORK1.xlsx]3.6.4
Report Created: 1/1/2018 11:56:58 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 4 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%,
Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$F$11Z total 348 241.7142857

Variable Cells
Cell Name Original Value Final Value Integer
$C$4 kilogram corn 1 1.142857143 Contin
$D$4 kilogram tankage 2 0 Contin
$E$4 kilogram alfalfa 2 2.428571429 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$F$7 Carbohy used 200 $F$7>=$H$7 Binding 0
$F$8 proteins used 180 $F$8>=$H$8 Binding 0
$F$9 vitamins used 157.1428571 $F$9>=$H$9 Not Binding 7.142857143

Ajeya Acharya 23
073MSTR252
 Assignment 1

Microsoft Excel 16.0 Sensitivity Report

Worksheet: [JKS SIR HOMEWORK1.xlsx]3.6.4
Report Created: 1/1/2018 11:56:58 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$C$4 kilogram corn 1.142857143 0 84 51 37.2
$D$4 kilogram tankage 0 17.71428571 72 1E+30 17.71428571
$E$4 kilogram alfalfa 2.428571429 0 60 11.27272727 22.66666667

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$F$7 Carbohy used 200 0.771428571 200 25 80
$F$8 proteins used 180 0.485714286 180 120 6
$F$9 vitamins used 157.1428571 0 150 7.142857143 1E+30

Ajeya Acharya 24
073MSTR252
 Assignment 1

Microsoft Excel 16.0 Limits Report

Worksheet: [JKS SIR HOMEWORK1.xlsx]3.6.4
Report Created: 1/1/2018 11:56:58 PM

Objective
Cell Name Value
$F$11 Z total 241.7142857

Variable Lower Objective Upper Objective

Cell Name Value Limit Result Limit Result
$C$4 kilogram corn 1.142857143 1.142857143 241.7142857 #N/A #N/A
$D$4 kilogram tankage 0 0 241.7142857 #N/A #N/A
$E$4 kilogram alfalfa 2.428571429 2.428571429 241.7142857 #N/A #N/A

Ajeya Acharya 25
073MSTR252