Scribd
Upload
530 views

HW6

This document contains 4 problems related to optimization and network flow modeling: 1) A game of hide and seek where children know the hiding places of other children and the goal is to find the plan for each child to find every other child through the smallest number of contacts. 2) A pipeline network connecting 3 refineries to 2 distribution terminals with pumping stations, where the problem is to determine the production, demand, and pumping capacity that matches the maximum capacity of the network. 3) Household chores must be assigned to 5 children based on their stated preferences, with the goal of completing as many chores as possible while honoring the children's preferences. 4) A minimum cost flow problem

Uploaded by

Jack Beltran Shepard
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
530 views

HW6

This document contains 4 problems related to optimization and network flow modeling: 1) A game of hide and seek where children know the hiding places of other children and the goal is to find the plan for each child to find every other child through the smallest number of contacts. 2) A pipeline network connecting 3 refineries to 2 distribution terminals with pumping stations, where the problem is to determine the production, demand, and pumping capacity that matches the maximum capacity of the network. 3) Household chores must be assigned to 5 children based on their stated preferences, with the goal of completing as many chores as possible while honoring the children's preferences. 4) A minimum cost flow problem

Uploaded by

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

Problem 1) Six kids, Joe, Kay, Jim, Bob, Rae, and Kim are playing a variation of hide and

seek. The holding


place of a child is known only to a select few of the other children. The child is then paired with another
with the objective of finding the partners hiding place. This may be achieved through a chain of other
kids who eventually will lead to discovering where the designated child is hiding. For example, suppose
that Joe needs to find Kim and that Joe knows where Jim is hiding, who in term knows where Kim is.
Thus, Joe can find him by first finding Jim, who in turn will lead Joe to Kim. The following list provides the
whereabouts of the children:
Joe knows the hiding places of Bob and Kim.
Kay knows the hiding places of Bob, Jim, and Rae.
Kim and Bob each know the hiding place of Kay only.
Rae knows where Kim is hiding.
Kim knows where Joe and Bob are hiding.
Devise a plan for each child to find every other child through the smallest number of contacts. What is
the largest number of contacts?
Problem 2) Three refineries send a gasoline product to two distribution terminals through a pipeline
network. Any demand that cannot be satisfied the network is acquired from other sources. The pipeline
network is served by three pumping stations, as shown in the figure below. The product flows in the
network in the direction shown by the arrows. The capacity of each pipe segment (shown directly on the
arcs) is in million bbl per day. Determine the following:
(a) The daily production at each refinery that matches the maximum capacity of the network.
(b) The daily demand at each terminal that matches the maximum capacity of the network.
(c) The daily capacity of each pump that matches the maximum capacity of the network.

Problem 3) A parent has five (teenage) children and five household chores to assign to them. Past
experience has shown that forcing chores on a child counterproductive. With this in mind, the children
are asked to list their preferences among the five chores, as the following table shows:

The parents modest goal now is to finish as many chores as possible while abiding by the
childrens preferences. Determine the maximum number of chores that can be completed and the
assignments of chores to children.
Problem 4) Consider the minimum cost flow problem shown below, where the bivalues are given by the
nodes, the cijvalues are given by the arcs, and the finiteuijvalues are given in parentheses by the arcs.
Obtain an initial BF solution by solving the feasible spanning tree with basic arcs A C , B A, C
D, and C E, where one of the nonbasic arcs (D A) is a reversearc. Then use the network
simplex method yourself (without an automatic computer routine) to solve this problem.

You might also like