Problem Set - 3

Integer Programming Problem

December 23, 2021

1. Five items are to be loaded in a vessel. The weight wi , volume vi , and value ri for item i are tabulated below.

The maximum allowable cargo weight and volume are 210 tons and 198 yd3, respectively. Formulate the ILP model, and
find the most valuable cargo.
2. Suppose that you have 7 full wine bottles, 7 half-full, and 7 empty. You would like to divide the 21 bottles among three
individuals so that each will receive exactly 7. Additionally, each individual must receive the same quantity of wine.
Express the problem as ILP constraints, and find a solution.
3. The three children of a farm couple are sent to the market to sell 90 apples. Karen, the oldest, carries 50 apples; Bill, the
middle one, carries 30; and John, the youngest, carries only 10. The parents have stipulated five rules: (a) The selling price
is either $1 for 7 apples or $3 for 1 apple, or a combination of the two prices. (b) Each child may exercise one or both
options of the selling price. (c) Each of the three children must return with exactly the same amount of money. (d) Each
child?s income must be in whole dollars (no cents allowed). (e) The amount received by each child must be the largest
possible under the stipulated conditions. Given that the three kids are able to sell all they have, use ILP to show how they
can satisfy the parents? conditions.
4. Once upon a time, there was a captain of a merchant ship who wanted to reward three crew members for their valiant effort
in saving the ship’s cargo during an unexpected storm in the high seas. The captain put aside a certain sum of money
in the purser?s office and instructed the first officer to distribute it equally among the three mariners after the ship had
reached shore. One night, one of the sailors, unbeknown to the others, went to the purser’s office and decided to claim
(an equitable) one-third of the money in advance. After he had divided the money into three equal shares, an extra coin
remained, which the mariner decided to keep (in addition to one-third of the money). The next night, the second mariner
got the same idea and, repeating the same three-way division with what was left, ended up keeping an extra coin as well.
The third night, the third mariner also took a third of what was left, plus an extra coin that could not be divided. When the
ship reached shore, the first officer divided what was left of the money equally among the three mariners, again to be left
with an extra coin. To simplify things, the first officer put the extra coin aside and gave the three mariners their allotted
equal shares. How much money was in the safe to start with? Formulate the problem as an ILP, and find the solution.
(Hint: The problem has a countably infinite number of integer solutions. For convenience, assume that we are interested in
determining the smallest sum of money that satisfies the problem conditions. Then, boosting the resulting sum by 1, add it
as a lower bound and obtain the next smallest sum. Continuing in this manner, a general solution pattern will emerge.)
5. The Record-a-Song Company has contracted with a rising star to record eight songs. The sizes in MB of the different
songs are 8, 10, 8, 7, 9, 6, 7, and 12, respectively. Record-a-Song uses two CDs for the recording. Each CD has a capacity
of 40 MB. The company would like to distribute the songs between the two CDs such that the used space on each CDs is
about the same. Formulate the problem as an ILP, and find the optimum solution. Suppose that the nature of the melodies
dictates that songs 3 and 4 cannot be recorded on the same CD. Formulate the problem as an ILP. Would it be possible to
use a 30 MB CDs to record the eight songs? If not, use ILP to determine the minimum CD capacity needed to make the
recording.
6. ABC is an LTL (less-than-truckload) trucking company that delivers loads on a daily basis to five customers. The following
list provides the customers associated with each route:

1
 The segments of each route are dictated by the capacity of the truck delivering the loads. For example, on route 1, the
capacity of the truck is sufficient to deliver the loads to customers 3 and 2 only. The following table lists distances (in
miles) among the truck terminal (ABC) and the customers.

The objective is to determine the least distance needed to make the daily deliveries to all five customers. Though the
solution may result in a customer being served by more than one route, an approximation in the implementation phase
assumes that only one such route is used. Formulate the problem as an ILP, and find the optimum solution.
7. Washington County includes six towns that need emergency ambulance service. Because of the proximity of some of the
towns, a single station may serve more than one community. The stipulation is that the station must be within 18 minutes
of driving time from the towns it serves. The table below gives the driving times in minutes among the six towns.

Formulate an ILP whose solution will produce the smallest number of stations and their locations. Find the optimum
solution.
8. Bill has just completed his exams for the academic year and wants to celebrate by seeing every movie showing in theaters
in his town and in six other neighboring cities. If he travels to another town, he will stay there until he has seen all the
movies he wants. The following table provides the information about the movie offerings and the round-trip distance to
the neighboring town:

2
 The cost of driving is 75 cents per mile. Bill wishes to determine the towns he needs to visit to see all the movies while
minimizing his total cost.
9. Walmark Stores is in the process of expansion in the western United States. During next year, Walmark is planning to
construct new stores that will serve 10 geographically dispersed communities. Past experience indicates that a community
must be within 25 miles of a store to attract customers. In addition, the population of a community plays an important role
in where a store is located, in the sense that bigger communities generate more participating customers. The following
table provides the populations as well as the distances (in miles) between the communities:

The idea is to construct the least number of stores, taking into account the distance restriction and the concentration of
populations. Specify the communities where the stores should be located.
10. MobileCo is budgeting $15 million to construct as many as 7 transmitters to cover as much population as possible in 15
contiguous geographical communities. The communities covered by each transmitter and the budgeted construction costs
are given below.

The following table provides the populations of the different communities:

Which of the proposed transmitters should be constructed?

11. Modern electric networks use automated electric utility meter reading in place of the more costly manual meter reading. In
the automated system, meters from several customers are linked wirelessly to a single receiver. The meter sends monthly
signals to a designated receiver to report the customer?s consumption of electricity. The data are then channeled to a
central computer to generate the utility bills. The objective is to determine the smallest number of receivers needed to
serve a given number of meters. In real life, the problem encompasses thousands of meters and receivers. This problem
deals with 10 meters and 8 possible locations for receivers, with the following configurations:

3
 Solve the problem if, additionally, each receiver can handle at most 4 meters and receiver 8 can handle meters 1, 4, 8, and
10.
12. Leatherco is contracted to manufacture batches of pants, vests and jackets. Each product requires a special setup of the
machines needed in the manufacturing processes. The following table provides the pertinent data regarding the use of raw
material (leather) and labor time together with cost and revenue estimates. Current supply of leather is estimated at 3800
ft2 and available labor time is limited to 2850 hours.

Determine the optimum number of units that Leatherco must manufacture of each product.
13. A manufacturing facility uses two production lines to produce three products over the next 6 months. Backlogged demand
is not allowed. However, a product may be overstocked to meet demand in later months. The following table provides the
data associated with the demand, production, and storage of the three products:

There is a fixed cost for switching a line from one product to another. The following tables give the switching cost, the
production rates, and the unit production cost for each line:

Develop a model for determining the optimal production schedule.

14. Gapco manufactures three products, whose daily labor and raw material requirements are given in the following table.

The profits per unit of the three products are $20, $25, and $18, respectively. Gapco has two options for locating its plant.
The two locations differ primarily in the availability of labor and raw material, as shown in the following table:

4
 Formulate the problem as an ILP, and determine the optimum location of the plant.
15. Jobco Shop has 10 outstanding jobs to be processed on a single machine. The following table provides processing times
and due dates. All times are in days, and due time is measured from time 0:

If job 4 precedes job 3, then job 9 must precede job 7. The objective is to process all 10 jobs in the shortest possible time.
Formulate the model as an ILP, and determine the optimum solution.
If suppose that job 4 cannot be processed until job 3 has been completed. Also, machine settings for jobs 7 and 8 necessitate
processing them one right after the other (i.e., job 7 immediately succeeds or precedes job 8). Jobco?s objective is to process
all ten jobs with the smallest sum of due-time violations. Formulate the model mathematically, and determine the optimum
solution.
16. UPak is a subsidiary of an LTL transportation company. Customers bring their shipments to the UPak terminal to be loaded
on the trailer and can rent space up to 36 ft. The customer pays for the exact linear space (in foot increments) the shipment
occupies. No partial shipment is allowed, in the sense that a shipment requiring no more than 36 ft must be loaded on one
trailer. A movable barrier, called bulkhead, is installed to separate shipments. The per-foot fee UPak collects depends on
the destination of the shipment. The following table provides the outstanding orders UPak needs to process:

The terminal currently has two trailers ready to be loaded. Determine the priority orders that will maximize the total
income from the two trailers. (Hint: A formulation using binary xi j to represent load i on trailer j is straightforward.
However, you are challenged to define xi j as feet assigned to load i in trailer j. Then use if-then constraint to prevent
partial load shipping.)