Contents

Title Page ................................................................................................................................................ 2

Abstract:.................................................................................................................................................. 3
Introduction: ............................................................................................................................................ 3
Operations Research: .......................................................................................................................... 3
Linear Programming: ........................................................................................................................... 3
Applications of Linear Programming: ................................................................................................... 3
Simplex Method: ................................................................................................................................. 4
Graphical Method:............................................................................................................................... 4
Excel Solver: ........................................................................................................................................ 4
Method: ................................................................................................................................................... 4
Task 1 ................................................................................................................................................. 4
Simple Linear Programming and Optimization ................................................................................. 4
Solution: .......................................................................................................................................... 4
Task 2 ................................................................................................................................................. 6
Transportation/Resource Allocation. ................................................................................................ 6
Solution: .......................................................................................................................................... 6
Task 3 ............................................................................................................................................... 10
Supermarket Staff Scheduling ........................................................................................................ 10
Solution: ........................................................................................................................................ 10
Task 4 ............................................................................................................................................... 13
A garden furniture company has 4 products: .................................................................................. 13
Solution: ........................................................................................................................................ 13
Results & Discussion: ............................................................................................................................ 21
Conclusion: ........................................................................................................................................... 21
References: ........................................................................................................................................... 21

1|P ag e
Title Page

2|P ag e
Abstract:
Operations research is a form of statistically based analysis that provides a quantitative basis for
management choices. There are several analysis methodologies, but in this study, we will focus
on one. we have used just 2 methods.
e.g. Graphical method and simplex method with excel solver by linear programming and LP
models.
Keywords: Operations Research, graphical method, simplex method, excel solver, linear
programming, LP model.
Introduction:

Operations Research:

OR, or operations research, is a subject that focuses on the development and implementation of
sophisticated analytical tools to assist people in making better decisions. It is sometimes
considered a branch of the mathematical sciences. The terms management science and
management science are occasionally used interchangeably.(Lewis, 2009)

In OR we can solve the problem by many techniques but we used Linear programming which is
one of them.

Linear Programming:

Linear programming is a technique for optimising a linear objective function and a collection of
linear constraints. The purpose of linear programming is to find the values of variables that
maximise or minimise an objective function specified by an objective function. (Andy Hayes,
2018)

Applications of Linear Programming:

Linear programming is used in many areas including food and agriculture, engineering,
transportation, manufacturing, and energy.

Some of the applications are given below. Applications in Engineering, Transportation

optimization, efficient manufacturing, and the energy industry.(Dotson, 2018)

3|P ag e
Algorithms:

In linear programming, we have many algorithms to solve the problem but here we have used
just graphical and simplex methods to solve the problems.

Simplex Method:

Because linear programming models are important in many sectors, a number of techniques to
solve them have been developed over time. The Simplex Method, the Hungarian Approach, and
other approaches have been mentioned. The graphical technique, which is one of the most
fundamental ways to solve a linear programming issue, will be the emphasis of this
section.(Wrighte, 2009), while

Graphical Method:

Dantzig's simplex method is a linear programming approach that is commonly used in

mathematics. T. S. Motzkin provided the algorithm's name, which is derived from the notion of a
simplex. (William L. Thompson, 2003)

For the simplex method, we have many tools to use but here we have used excel solver to solve
the problems easily
Excel Solver:
Excel Solver is a tool which is using to find the best value for a formula in a single cell
(objective function) that is bound by the values of other formula cells.

Method:

Task 1

Simple Linear Programming and Optimization

Solution:
Decision Variables:

Let X1 and X2 be the number of products produced of product A and B respectively,

The LP formulation is as follows.

Constraints

X1+X2=>20+k -----i

200X1+100X2<=8000-------ii

X2<=2X1

4|P ag e
 X2-2X1<=0--------iii

X2=>1/2X1

2X2-X1=>0----------iv

X1>=0------------v,

X2>=0-----------vi

Objective Function:

MAX Z=40X1+60X2

Graphical Method Solution:

90
C2
80

70

60
C1
50
C1 C2
40 C3

30 OF
C3
20
Feasible Region
10

0
0 10 20 30 40 50 60

5|P ag e
Excel Solver

Task 2

Transportation/Resource Allocation.

Solution:
Student ID: 828827

a=8, b=2, c=8, d=8, e=2 & f=7.

Total Supply=1500

Total Demand=1260

Total Supply ≠ Total Demand

Constraints:

Supply Constraints ≤

2X11+2X12+5X13+4X14+1X15+2X16≤300

4X21+5X22+2X23+3X24+7X25+1X26≤500

8X31+2X32+8X33+8X34+2X35+7X36≤450

7X41+2X42+8X43+8X44+2X45+8X46≤250

Demand Constraints ≥

6|P ag e
 2X11+4X21+8X31+7X41≥150

2X12+5X22+2X32+2X42≥440

5X13+2X23+8X33+8X43≥215

4X14+3X24+8X34+8X44≥230

Objective Function:

MinZ=2X11+2X12+5X13+4X14+1X15+2X16+4X21+5X22+2X23+3X24+7X25+1X26+8X31
+2X32+8X33+8X34+2X35+7X36+7X41+2X42+8X43+8X44+2X45+8X46

Solution by Excel Solver:

7|P ag e
8|P ag e
9|P ag e
Task 3

Supermarket Staff Scheduling

Solution:

1) Linear programming model is formulated as below:

Variables:

F = number of full-time staff working from 9 am to 5 pm

P1=number of part-time staff working from 9 am to 3 pm

P2=number of part-time staff working from 10 am to 4 pm

P3= number of part-time staff working from 11 am to 5 pm

P4= number of part-time staff working from 12 pm to 6 pm

P5= number of part-time staff working from 1 pm to 7 pm

P6= number of part-time staff working from 3 pm to 9 pm

P7= number of part-time staff working from 6 pm to 12 am

P8= number of part-time staff working from 9 pm to 3 am

P9= number of part-time staff working from 3 am to 9 am

.Objective Function:

Min Z= 90F + 48P1 + 48P2 + 48P3 + 48P4 + 48P5 + 48P6 + 48P7 + 48P8 + 48P9

Constraints:

F <= 10 (supermarket has 10 full-time staff only)

F+P1 >= 12

F+P1+P2 >= 10

F+P1+P2+P3 >= 10

F+P1+P2+P3+P4 >= 10

F+P1+P2+P3+P4+P5 >= 16

10 | P a g e
F+P2+P3+P4+P5+P6 >= 14

F+P3+P4+P5+P6 >= 14

P4+P5+P6 >= 14

P5+P6+P7 >= 20

P6+P7 >= 20

P7+P8 >= 5

P8 >= 5

P9 >= 4

6P1+6P2+6P3+6P4+6P5+6P6+6P7+6P8+6P9 >=
0.8*(8F+6P1+6P2+6P3+6P4+6P5+6P6+6P7+6P8+6P9) (part-time hours <= 80% of total)
F >= 0

P1 >= 0

P2 >= 0

P3 >= 0

P4 >= 0

P5 >= 0

P6 >= 0

P7 >= 0

P8 >= 0

P9 >= 0

b) Solution by Excel Solver:

11 | P a g e
12 | P a g e
Task 4

A garden furniture company has 4 products:

Solution:

Formulation of the Linear Programming model:

Decision variables:

Garden tables =x1

Garden chairs =x2

Garden benches =x3

13 | P a g e
Parasols =x4

Objective function:

Maximize z =260x1+140x2+60x3+50x4

Constraints:

Hours available:

8x1+6x2+4x3+2x4 ≤800--------1

Material budget:

60x1+20x2+25x3+10x4 ≤3000---------2

Product diversity

X1 ≥5--------3

x2 ≥5-------4

x3 ≥5--------5

x4 ≥5----------6

Minimum chairs:

x2 ≥4(x1+x3)

or -4x1+x2-4x3 ≥0------7

Maximum parasols:

x4 ≤x1

x4- x1 ≤0--------8

X1≥0----------9

X2≥0-----------10

X3≥0-----------11

X4≥0----------12

b) Solution by Excel Solver:

14 | P a g e
15 | P a g e
 Solved:

16 | P a g e
C)

By changing 800 to 1000 hours

d) by changing budget from 3000 to 5000 and checking net profit

17 | P a g e
e) To remove benches and rest conditions remain same

Solution

18 | P a g e
19 | P a g e
20 | P a g e
Results & Discussion:
Task 1: We can maximize our profit to 3200 by using all constraints given in the problem.
Task 2: We can minimize our cost to 1035 by using all constraints given in the problem.
Task 3: We can minimize our cost to 1536 by using all constraints given in the problem.
Task 4: In task 4 we have many parts and conditions
a. On the given conditions we can maximize our profit to 19060.
b. By changing the number of hours from 800 to 100 we can maximize of profit to 10490.
c. By changing budget from 3000 to 5000 we can maximize our profit to 20000.
d. By removing the bench We can maximize our profit to 17400 by using all constraints
given in the problem.

Conclusion:
From this technical report I conclude that I have learnt many things including what is OR, Linear
programming, how to make LP model, techniques, algorithms and tools using to solve OR
problems.

References:
1. Andy Hayes, W. P. J. K., 2018. Brilliant. [Online]
Available at: https://brilliant.org/wiki/linear-
programming/#:~:text=Linear%20programming%20is%20an%20optimization,or%20minimize%2
0the%20objective%20function.

2. Dotson, J. D., 2018. Sciencing. [Online]

Available at: https://sciencing.com/five-application-linear-programming-techniques-
7789072.html
[Accessed 21 May 2018].

3. Lewis, S., 2019. TechTarget. [Online]

Available at: https://whatis.techtarget.com/definition/operations-research-OR
[Accessed September 2019].

4. William L. Thompson, .. C. G., 2003. Sciencedirect. [Online]

Available at: https://www.sciencedirect.com/topics/earth-and-planetary-sciences/graphical-
method#:~:text=Graphical%20methods%20are%20commonly%20used,fractionation%20of%20a
%20single%20source

5. Wright, S. J., 2009. Britannica. [Online]

Available at: https://www.britannica.com/topic/simplex-method

21 | P a g e