[go: up one dir, main page]
Scribd
Upload
40 views6 pages

Operations Research Assignment

This document presents an optimization problem involving minimizing a cost function subject to constraints. The cost function involves minimizing staffing costs over four shifts by determining the optimal number of full-time (X) and part-time (Y) consultants to assign to each shift. Graphical and algebraic methods are used to solve for the minimum point that satisfies all constraints. The optimal solution found is X1=3, X2=2, X3=0, Y1=2, Y2=4, Y3=6, Y4=4, with a minimum objective function value of Z=13.

Uploaded by

cool_stud_wali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
40 views6 pages

Operations Research Assignment

This document presents an optimization problem involving minimizing a cost function subject to constraints. The cost function involves minimizing staffing costs over four shifts by determining the optimal number of full-time (X) and part-time (Y) consultants to assign to each shift. Graphical and algebraic methods are used to solve for the minimum point that satisfies all constraints. The optimal solution found is X1=3, X2=2, X3=0, Y1=2, Y2=4, Y3=6, Y4=4, with a minimum objective function value of Z=13.

Uploaded by

cool_stud_wali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA

Assignment 1
Introduction to Operations Research

Submitted to Professor Peng Yi

3.4-5. Use the graphical method to solve this problem:


Minimize Z = 3x1+ 2x2,
Subject to
x1+2x2 < 12
2x1 + 3x2 = 12
2x1 + x2 8
And
x1 0 , x2 0
x1 + 2x2 = 12

2x1 + 3x2 = 12

2x1 + x2 = 8

Let x1=0

Let x1=0

Let x1=0

(0) + 2x2 = 12
8
x2 = 6 (0,6)

2(0)+ 3x2 = 12
x2 = 4 (0,4)

2(0) + x2 =
x2 = 8 (0,8)

Let x2 = 0

Let x2 = 0

Let x2 = 0

x1 = 12 (12,0)
(4,0)

x1 = 6 (6, 0)

x1 = 4

Since we have to minimize the value of Z


And Z = 3x1+ 2x2,
Lets Assume Z= 20
Therefore
3x1 + 2x2 = 20
If x1=0 then, (0,10)
If x2=0 then, (6.7, 0)
Since we have to minimize and we have the margin to minimize further therefore
Lets Assume Z= 15
Therefore
3x1 + 2x2 = 15
If x1=0 then, (0, 7.5)
If x2=0 then, (5, 0)

Move the ruler downwards until it intersects through the feasible regions last point,
it gave us the minimum value of (3, 2). The feasible region is (3,2) because that is
the only point that satisfies all the conditions. It is also the optimal solution.

Z = 3X1+ 2X2
when X1= 3 and X2= 2
Z = 3(3) + 2(2)
Z=9+4

Z =13
Therefore, the minimum value of Z is 13

Problem 3-4-10
VARIABLES X1, X2, X3, X4, Y1, Y2, Y3, Y4
Let:
Shift

8:00 am to
Noon
X1

Full
Time
Part
Time
Minimu
m
Consult
ants

Noon to
04:00 pm
X2

X1
X2
X3
X1
X2
X3

08:00 pm to
mid night

Y1

Y2

Y3

Y4

10

Constraints

04:00 pm to
08:00 pm
X3

+ Y1 > 4
+ Y2 > 8
+ Y3 > 10
/ Y1 > 2 X1 2Y1 > 0
/ Y2 > 2 X2 2Y2 > 0
/ Y3 > 2 X3 2Y3 > 0

X1 2Y1
X1 > 0, X2 > 0, X3 > 0, Y1 > 0, Y2 > 0, Y3 > 0, Y4 > 0

OBJECTIVE FUNCTION
Minimize Z= (40x8)(X1+X2+X3)+(30x4)(Y1+Y2+Y3+Y4)

You might also like