Contents

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

Abstract: ................................................................................................................................................ 3
Introduction: ........................................................................................................................................... 3
Method: .................................................................................................................................................. 3
Task 1 ................................................................................................................................................ 3
Solution: ......................................................................................................................................... 3
Task 2 ................................................................................................................................................ 5
Solution: ......................................................................................................................................... 5
Task 3 .............................................................................................................................................. 10
Solution: ....................................................................................................................................... 10
Task 4 .............................................................................................................................................. 12
Solution: ....................................................................................................................................... 12
Results & Discussion:......................................................................................................................... 18
Conclusion:.......................................................................................................................................... 18
References: ......................................................................................................................................... 19

1
Title Page

2
Abstract:
Operations research is a mathematical formula that provides the basis for a wide range of management
options. There are various methods of analysis, but we have used only two of them in this paper.

For example, graphical and simplex methods that use excel solutions based on precise systems and LP
models.

Keywords: Operations research, graphical method, simplex method, excels solution, linear programing,
and LP model.

Introduction:
OR, or Operations research, is a topic that focuses on the development and use of high-quality
analytical tools to help people make better decisions. It is sometimes regarded as a branch of
mathematical science. The terms science management and management science are used
interchangeably from time to time (Lewis, 2009). We can solve problems using a variety of
strategies, one of which is linear programming. Linear programing is a way to improve the
purpose of a line function and a set of line barriers. The purpose of linear programing is to find
variable values that increase or decrease the function of the objective. (Andy Hayes, 2018)
There are various strategies in line with problem-solving programs; however, we have used
graphic and simplex methods in this case. Because online system models are important in
many fields, a number of solutions have been developed over time. The Simplex Method, as
well as the Hungarian method, is all mentioned. (Wrighte, 2009). The graphics method, which is
one of the most important ways to solve the problem of OR Problem, will be the emphasis of
this section. While Dantzig's simplex algorithm is the most widely used mathematical algorithm
(William L. Thompson, 2003). T. S. Motzkin gave the name of the algorithm, based on the
simplex concept. We have many tools that we can use easily, yet here we have used an excel
solver to solve problems quickly.

Method:

Task 1

Solution:
Let X1 and X2 be the number of products produce of product A and B respectively,

The LP formulation is as follows.

Constraints

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

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

X2<=2X1

3
X2-2X1<=0--------iii

X2=>1/2X1

2X2-X1=>0----------IV

X1, X2>=0-----------vie

Objective Function:

MAX Z=40X1+60X2

Graphical Method Solution:

Extreme Points

A (20,40)

B (32,16)

Objective Function:

Max (z) = 40x1 + 60x2

For A

Z = 40 (20) + 60 (40) = 800 + 2400

Z = 3200 (Max)

For B

4
Z= 40 (32) + 60 (16) = 1280 + 960 = 2240

3200 is maximum which answer is.

Excel Solver

Task 2

Solution:
Student ID: 827862

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

Total Supply=1500

Total Demand=1500

Total Supply = Total Demand

Constraints:

Supply Constraints ≤

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

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

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

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

Demand Constraints ≥

2X11+4X21+8X31+2X41≥150

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

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

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

X15+7X25+6X35+2X45≥225

2X16+X26+2X36+8X46≥240

Objective Function:

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

Solution by Excel Solver:

6
7
8
9
Task 3

Solution:
1) Linear programming model is formulated as below:

Decision Variables:

Full Time Staff:

F = staff working from 9 am to 5 pm

Part Time staff:

P1 staff working from 9 am to 3 pm

P2 staff working from 10 am to 4 pm

P3 staff working from 11 am to 5 pm

P4 staff working from 12 pm to 6 pm

P5 staff working from 1 pm to 7 pm

P6 staff working from 3 pm to 9 pm

P7 staff working from 6 pm to 12 am

P8 staff working from 9 pm to 3 am

P9 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
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

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

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

P4+P5+P6 >= 14

P5+P6+P7 >= 20

10
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)
F, P1, P2, P3, P4, P5, P6, P7, P8, P9 >= 0

2) Solution by Excel Solver:

11
Task 4

Solution:
Formulation of the Linear Programming model:

Decision variables:

Garden tables =x1

Garden chairs =x2

Garden benches =x3

Parasols =x4

12
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:

13
14
Solved:

15
C)

By changing 800 to 1000 hours

New Solution by Excel Solver:

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

After changing 3000 to 5000

e)

To remove benches and rest conditions remain same

Solution

17
Results & Discussion:
Task 1: Using all of the limitations in the challenge, we can maximize our profit to 3200.

Task 2: Using all of the limitations in the issue, we can reduce our cost to $793.95.

Task 3: Using all of the limitations in the issue, we can reduce our cost to 1536.

Task 4: We have a lot of elements and conditions in task 4.

a) Under the above circumstances, we can maximize our profit to 19060.

b) By reducing the number of hours from 800 to 100, we may increase the profit to 19490.
c) By increasing our budget from 3000 to 5000, we may increase our profit to 17400.
d) By eliminating the bench we can optimize our profit to 250 by utilizing all of the
limitations in the challenge.

Conclusion:
This technical report has taught me many things, including what OR are, linear programming,
how to create an LP model, strategies, algorithms, and tools for solving OR issues.

18
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

19