Scribd
Upload
33 views

Assignment #3 - Chapters 5, 6, and 7: Problem 15, Chapter 5 15

This document contains problems and solutions from Chapters 5, 6, and 7 of an operations research or management science textbook. It includes linear programming problems that minimize or maximize objective functions subject to various constraints, as well as shortest path problems solved using Dijkstra's algorithm and a maximum flow problem modeled as a linear program. The problems cover topics like employee scheduling, facility location, portfolio optimization, and transportation modeling.

Uploaded by

Reda Lefriyekh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Assignment #3 - Chapters 5, 6, and 7: Problem 15, Chapter 5 15

This document contains problems and solutions from Chapters 5, 6, and 7 of an operations research or management science textbook. It includes linear programming problems that minimize or maximize objective functions subject to various constraints, as well as shortest path problems solved using Dijkstra's algorithm and a maximum flow problem modeled as a linear program. The problems cover topics like employee scheduling, facility location, portfolio optimization, and transportation modeling.

Uploaded by

Reda Lefriyekh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Assignment #3 Chapters 5, 6, and 7

Problem 15, Chapter 5


15.

xi = no. of employees assigned to time period i, i = 1, 2, . . , 6 (time period 1 = 12:00 midnight 4:00
A.M.; period 2 =
4:008:00 A.M.; etc.)

Minimize Z = x1 + x2 + x3 + x4 + x5 + x6
subject to
x6 + x1 90

x1 + x2 215
x2 + x3 250
x3 + x4 65
x4 + x5 300
x5 + x6 125
xi 0
x1 = 90, x2 = 250, x3 = 0, x4 = 175, x5 = 125,
x6 = 0, Z = 640
Problem 20, Chapter 5
20.

xij = vehicles [1,000s shipped from plant i


(i = 1, 2, 3, 4, 5) to warehouse j (j = A, B, C, D)], yi = plant i (i = 1,2,3,4,5) = 0 or 1
minimize Z = 2,100,00y1 + 850,000y2 + 1,800,000y3

+ 1,100,000y4 + 900,000y5 + 56x1A


+ 21x1B + 32x1C + 65x1D
+ 18x2A + 46x2B + 70x2C
+ 35x2D + 12x3A + 71x3B
+ 41x3C + 52x3D + 30x4A
+ 24x4B + 61x4C + 28x4D + 45x5A
+ 50x5B + 26x5C + 31x5D
subject to

12, 000 y1 x1A x1B x1C x1D = 0


18, 000 y2 x2A x2B x2C x2D = 0
14, 000 y3 x3A x3B x3C x3D = 0
10, 000 y4 x4A x4B x4C x4D = 0
16, 000 y5 x5A x5B x5C x5D = 0
x1A + x2A + x3A + x4A + x5A = 6, 000
x1B + x2B + x3B + x4B + x5B = 14,000
x1C + x2C + x3C + x4C + x5C = 8, 000
x1D + x2D + x3D + x4D + x5D = 10,000
xij , yi 0
yi = 0 or 1
Solution: y1, y4, y5 = 1,
x1B = 12,000, x4A = 6,000,
x4B = 2,000, x4D = 2,000,
x5C = 8,000, x5D = 8,000
Z = $5,092,000

Problem 22, Chapter 5


22. a) Minimize Z = 5x1 + 10x2 + 8x3 + 12x4 + 7x5
+ 10x6 + 8x7
subject to
9 x1 + 6 x2 + 6 x3 + 3x4 + 6 x5 + 3x6 + 9 x7
2.00
3( x1 + x2 + x3 + x4 + x5 + x6 + x7 )
3( x1 + x2 + x3 + x4 + x5 + x6 + x7 ) 12
x2 + x3 + x4 + x6 2
x1 + x2 + x6 + x7 3
xi = 0 or 1

b) x1 = 1 (Management I)
x2 = 1 (Principles of Accounting)
x5 = 1 (Marketing Management)
x7 = 1 (English Literature)
Z = 30 hours per week
Minimum grade point average = 2.50

Problem 28, Chapter 5


28.

Minimize Z = 120x1 + 75x2


subject to
220x1 + 140x2 6,300
x1 + x2 32
.4x1 + .9x2 15

x1,x2 0 and integer


Non-integer solution:
x1 = 25.1409
x2 = 5.493
Z = $3,428.87
Integer solution:
x1 = 25
x2 = 1
Z = $3,435

Problem 37, Chapter 5

37.

Maximize Z = 127x1 + 83x2 + 165x3 + 96x4 + 112x5 + 88x6 + 135x7 + 141x8 + 117x9 + 94x10
subject to
x1 + x3 1
x1 + x2 + x4 1
x4 + x5 + x6 1
x6 + x7 + x8 1
x6 + x9 1
x8 + x10 1
x9 + x10 1
xi = 0 or 1
Solution:
x2 = 1
x3 = 1
x5 = 1
x8 = 1
x9 = 1
Z = $618,000

Problem 15, Chapter 6

15.

x1B = 250
x1D = 170
x2A = 520
x2C = 90
x3C = 130
x3D = 210
Z = $21,930

Problem 36, Chapter 6

36.

x14 (Hamburg - Norfolk) = 42


x59 (NY - Chicago) = 50
x26 (Marseilles - Savannah) = 63
x35 (Liverpool - NY) = 37
x48 (Norfolk - St. Louis) = 42
x15 (Hamburg - NY) = 13
x67 (Savannah - Dallas) = 60
x68 (Savannah - St. Louis) = 3
Z = $77,362

HND = 38
HNS = 17
MSD = 22

Problem 5, Chapter 7

Following the application of Dijkstra, the shortest path tree rooted at the origin would be:

Problem 18, Chapter 7

minimum distance = 70
13
24
34
46
47
57
Problem 36, Chapter 7
After developing a LP model for the max flow problem, we find the following optimal solution:

You might also like