Management Science and Systems Engineering

Homework 4

Student NAME: Muhammad Saad Ameer

Chapter integer programming

Problem 1:
A group of college students is planning a camping trip during the upcoming
break. The group must hike several miles through the woods to get to the campsite,
and anything that is needed on this trip must be packed in a knapsack and carried to
the campsite. One particular student, Tina Shawl, has identified eight items that she
would like to take on the trip, but the combined weight is too great to take all of them.
She has decided to rate the utility of each item on a scale of 1 to 100, with 100 being
the most beneficial. The item weights in pounds and their utility values are given
below. Recognizing that the hike to the campsite is a long one, a limit of 35 pounds
has been set as the maximum total weight of the items to be carried.

(1) Formulate this as a 0–1 programming problem to maximize the total utility
of the items carried. Solve this knapsack problem using a computer.
(2) Suppose item number 3 is an extra battery pack, which may be used with
several of the other items. Tina has decided that she will only take item number 5, a
CD player, if she also takes item number 3. On the other hand, if she takes item
number 3, she may or may not take item number 5. Modify this problem to reflect this
and solve the new problem.
Solution:
Maximize profit = 3X1+ 5X2
subject to 7X1+ 3X2 ≤ 57
50X1 + 50X2 ≤ 53
X1, X2 ≥ 0
Where
X1 = number of weight
X2 = number of utility
Problem 2:
The Bayside Art Gallery is considering installing a video camera security system
to reduce its insurance premiums. A diagram of the eight display rooms that Bayside
uses for exhibitions is shown in Figure 7.13; the openings between the rooms are
numbered 1 through 13. A security firm proposed that two-way cameras be installed at
some room openings. Each camera has the ability to monitor the two rooms between
which the camera is located. For example, if a camera were located at opening
number 4, rooms 1 and 4 would be covered; if a camera were located at opening 11,
rooms 7 and 8 would be covered; and so on. Management decided not to locate a
camera system at the entrance to the display rooms. The objective is to provide
security coverage for all eight rooms using the minimum number of two-way
cameras.

（1） Formulate a 0-1 integer linear programming model that will enable Bayside’s
management to determine the locations for the camera systems.
（2） Solve the model formulated in part (a) to determine how many two-way
cameras to purchase and where they should be located.
（3） Suppose that management wants to provide additional security coverage for
room 7. Specifically, management wants room 7 to be covered by two
cameras. How would your model formulated in part (a) have to change to
accommodate this policy restriction?
（4） With the policy restriction specified in part (c), determine how many two-way
camera systems will need to be purchased and where they will be located.