Operations Research Scratch
Operations Research Scratch
Group Assignment on : Applications of Linear Programming: Solving Problem Set 1 Using MS Excel Solver
Course Code : ACC – 310
Course Title : Operations Research
Submitted to:
Md. Thasinul Abedin
Assistant Professor
Department of Accounting
University of Chittagong
Submitted by :
Name ID
Nadia Afrin Nima 21301009
Sadia Islam Sumaiya 21301011
Meher Nigar 21301021
Anika Tabassum 21301082
Murshida Akter Rupa 21301128
Afia Sanjida 21301132
Solution to the Problem no. 1
Decision Variables :
Objective Function :
Argmax(Z=5000* X1+8500*X2+2400*X3+2800*X4)
Subject to X1 ≤ 12
X2 ≤ 5
X3 ≤ 25
X4 ≤ 20
800*X1+925*X2+290*X3+380*X4 ≤ 8000
X3+X4 ≥ 5
290*X3+380*X4 ≤ 1800
X1 , X2 , X3 , X 4 ≥ 0
Step 1 :
Step 2 :
Step 3 :
Step 4 :
Step 5 :
Step 6 : Final Solution
Solution to the Problem no. 2
Decision Variables :
Objective Function :
Argmin(Z=7.50*X1+6.80*X2+5.50*X3+6.90*X4+7.25*X5+6.10*X6)
Subject to X1+X2+X3+X4+X5+X6 ≥ 2300
X1+X4 ≥ 1000
X2+X5 ≥ 600
0.85X1+0.85X2+0.85X3-0.15X4-0.15X5-0.15X6≥ 0
0.80X3-0.2X6≤0
Step 1 :
Step 2 :
Step 3 :
Step 4 :
Step 5 :
Step 6 : Final Solution
Solution to the Problem no. 3
Decision Variables:
Fifth Avenue’s goal is to maximize monthly profit given the following variables :
Fifth Avenue also has to calculate profit per tie for the objective function:
Variety of tie Selling price Material required Material cost per Cost per tie ($) Profit per tie ($)
per tie($) per tie (yards) yard ($)
All silk 19.24 0.125 24 3 16.24
All polyester 8.70 0.08 6 0.48 8.22
Poly-cotton blend 1 9.52 0.05 6 0.30 8.77
0.05 9 0.45
Silk cotton blend 2 10.64 0.06 24 1.44 8.66
0.06 9 0.54
Objective Function :
Argmax(Z=16.24X1+8.22X2+8.77X3+8.66X4)
Subject to 0.125X1+0.066X4≤1200
0.08X2+0.05X3≤3000
0.05X3+0.44X4≤1600
X1≥5000
X1≤7000
X2≥10000
X2≤14000
X3≥13000
X3≤16000
X4≥5000
X4≤8500
X1,X2,X3,X4 ≥0
Solving the problem Using MS Excel Solver :
Step 1 :
Step 2 :
Step 3:
Step 4:
Step 5:
Step 6: Final Solution
Solution to the Problem no. 4
Decision Variables :
Objective Function
Argmax(Z=0.07X1+0.11X2+0.19X3+0.15X4)
Subject to X1≤1,000,000
X2≤2,500,000
X3≤1,500,000
X4≤1,800,000
-0.55X1-0.55X2+0.45X3+0.45X4≥0
0.85X1-0.15X2-0.15X3-0.15X4≥0
Step 1 :
Step 2 :
Step 3 :
Step 4 :
Step 5 :
Step 6 : Final Solution