Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
24 views

Assignment Two

1. The document discusses an assignment involving network flow problems and integer programming. It includes a network flow problem that asks to determine maximum flow through a pipeline network and redraw the network to achieve this flow. It also provides an integer programming problem to maximize profit subject to multiple constraints. 2. A minimal spanning tree problem is presented that asks to find the minimum distance required to connect nodes in a network given distances between arcs. 3. A production planning problem for a company that makes chandeliers and ceiling fans is described. The problem involves determining production quantities to optimize multiple objectives given constraints on available wiring and assembly time.

Uploaded by

Abdirazak Ahmed Hassan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views

Assignment Two

1. The document discusses an assignment involving network flow problems and integer programming. It includes a network flow problem that asks to determine maximum flow through a pipeline network and redraw the network to achieve this flow. It also provides an integer programming problem to maximize profit subject to multiple constraints. 2. A minimal spanning tree problem is presented that asks to find the minimum distance required to connect nodes in a network given distances between arcs. 3. A production planning problem for a company that makes chandeliers and ceiling fans is described. The problem involves determining production quantities to optimize multiple objectives given constraints on available wiring and assembly time.

Uploaded by

Abdirazak Ahmed Hassan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIVERSITY OF HARGEISA

SCHOOL OF GRADUATE STUDIES


DEPARTMENT OF PROJECT MANAGEMENT

Course responsible: Temesgen Kebede (PhD, Haramaya University)


Email:temesgenkebede@gmail.com

Student Name (individual assignment):


1. Dr. Jamal Abdirashed Osman

Assignment two
Weight: 15%
Submission Date:

1. Consider the following network that shows an arrangement of pipeline. The


capacity of each pipeline to enable flow of water from its source (A) to its
destination (G) in liters is given below.

B C D
500 370
750
A 200 90 400
680 E 400 650 G
F

(a) Determine the maximum possible flow of water from A to G

Max flow from A to G = 1000

(b) Redraw the network that shows the direction along each pipeline in order
to achieve maximum flow at G

B C
370 D
570 370
A 200 60 400
430
430 F 600 G
E

2. Solve the following integer programming using excel solver.


Max profit= 5L + 3M + 4N
Subjected to 70L + 50M + 40N ≤ 2000
5L + 2M + 4N ≤ 400
1.25L + 1.5M + 2N≤ 60
L,M,N≥0
L,M,N are integers

3. The following Table represents a network with the arcs identified by their
starting and ending nodes. Draw the network and use the minimal-spanning
tree technique to find the minimum distance required to connect these nodes.
ARC DISTANCE
1–2 12
1–3 11
2–3 6
2–4 4
2–5 9
3–4 4
3–5 12
4–5 15
4–6 5
5–6 9

4
2 4
12 6 9 4 15 5
1 6
11 9
12
3 5
1-3+3-4+2-4+4-6+5-6= 11+4+4+5+9 = 33
Minimum spinning tree = 33

4. XYZ Electric Company produces two products popular with home renovators:
old-fashioned chandeliers and ceiling fans. Both the chandeliers and the fans
require a two-step production process involving wiring and assembly. It takes
about 2 hours to wire each chandelier and 3 hours to wire each ceiling fan. Final
assembly of the chandeliers and fans requires 6 and 5 hours, respectively. The
production capability is such that only 12 hours of wiring time and 30 hours of
assembly time are available. Each chandelier produced nets of $7 and each fan
nets of $6. Because of the global competition the company’s management wants
to relocate its production area. Hence, the management team has stated the
following objectives to be achieved in the production season. Moreover, assume
that all of the goals are prioritized accordingly.
Goal 1: to produce profit of $30 if possible during the production period.
Goal 2: to fully utilize the available wiring department hours
Goal 3: to avoid overtime in the assembly department
Goal 4: to meet a contract requirement to produce at least seven ceiling
fans
(a) Find the optimal solution using a QM Window and interpret the result.

You might also like