IP Exercise To Students 2020 PDF

Exercise: IP
Problem 1.
Houseco Developers is considering erecting three office buildings. The time required to
complete each and the number of workers required to be on the job at all times are shown in
the table below. Once a building is completed, it brings in the following amount of rent per year:
building 1, $50,000; building 2, $30,000; building 3, $40,000. Houseco faces the following
constraints:
1. During each year, 60 workers are available.
2. At most, one building can be started during any year.
3. Building 2 must be completed by the end of year 4.
Formulate an IP that will maximize the total rent earned by Houseco through the end of year
4.
Building Duration of Project (Years) Number of Workers Required
1 2 30
2 2 20
3 3 20
Problem 2.
A factory is making the production plan for next week, and it has seven products. The profit
and production time of each product are given in the table below.
Product Profit (per unit) Production time (hour per unit)
1 10 1.0
2 22 2.0
This study source was downloaded by 100000836140833 from CourseHero.com on 12-24-2021 10:58:41 GMT -06:00
https://www.coursehero.com/file/83806101/IP-exercise-to-students-2020pdf/
3 35 3.7
4 19 2.4
5 55 4.5
6 10 0.7
7 115 9.5
(a) The company has 720 working hours a week. Formulate an IP to maximize the profit.
(b) Consider a new constraint. If any of product 7 is produced, an extra fixed cost of 2000
will be incurred. Formulate a new IP to maximize the profit.
(c) Consider one more constraint. If each unit of product 2 that is produced over 100 units
requires a production time of 3 hours instead of 2 hours. Formulate an IP to maximize
the profit.
Problem 3.
Suppose that a mathematical model fits linear programming except for the restrictions that
(i) At least one of the following two inequalities holds:

𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 ≤ 4
3𝑥1 − 𝑥2 − 𝑥3 + 𝑥4 ≤ 3
(ii) At least two of the following four inequalities hold:

5𝑥1 + 3𝑥2 + 3𝑥3 − 𝑥4 ≤ 10
2𝑥1 + 5𝑥2 − 𝑥3 + 3𝑥4 ≤ 10
−𝑥1 + 3𝑥2 + 5𝑥3 + 3𝑥4 ≤ 10
3𝑥1 − 𝑥2 + 3𝑥3 + 5𝑥4 ≤ 10
Show how to reformulate these restrictions to fit an MIP model.
Problem 4.
ABC is a company that manufactures small items. It uses trucks to deliver goods to five guests
(1, 2, 3, 4 and 5) every day. There are several paths for the delivery and the guest information
with each path is given in the following table.
Path No. Guests on path
1 1,2,3,4
2 4,3,5
3 1,2,5
4 2,3,5
5 1,4,2
6 1,3,5
Because of the capacity limit of each truck, each path is predetermined. For example, the truck
on path 1 only has the capacity to meet the needs of guest 1, 2, 3 and 4. The distances between
ABC Company and each guest are given below.
Distance (miles)
ABC 1 2 3 4 5
ABC 0 10 12 16 9 8
1 10 0 32 8 17 10
2 12 32 0 14 21 20
3 16 8 14 0 15 18
4 9 17 21 15 0 11
5 8 10 20 18 11 0
Try to find out an optimal delivery scheme with the shortest distance to satisfy the needs of
these five guests. There may be the situation that one guest is on two paths at the same time,
we can choose one path to satisfy its need during the actual delivery.
Formulate an IP model for this problem.
Problem 5.
Jobco Company is planning to manufacture at least 2000 products using three machines. Each
machine is able to manufacture at least 500 products. Specific details are given in the following
table. The objective is to minimize the total cost.
Production cost of Maximum production

Machine No. Fixed cost($)
each product ($) capacity
1 300 2 600
2 100 10 800
3 200 5 1,200
Formulate an IP model for this problem.
Problem 6.
A young couple, Eva and Steve, want to divide their main household chores (cleaning, cooking,
dishwashing, and laundering) between them so that each has two tasks but the total time they
spend on household duties is kept to a minimum. Their efficiencies on these tasks differ, where
the time each would need to perform the task is given by the table below. Formulate an IP model
for this problem.
Time Needed per Week
Cleaning Cooking Dishwashing Laundry
Eva 4.5 hours 7.8 hours 3.6 hours 2.9 hours
Steve 4.9 hours 7.2 hours 4.3 hours 3.1 hours
Problem 7.
There are three types of bottles filled with water, type A with 1L per bottle, type B with 0.5L
per bottle and type C with no water in the bottle. The amount of each type of bottle is 7 (total
amount of the bottles is 21). Now we would like to distribute all the 21 bottles to 3 persons on
the condition that each person gets 7 bottles as well as the same volume of water. Describe this
problem with integer programming model constraints.
Powered by TCPDF (www.tcpdf.org)

IP Exercise To Students 2020 PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

IP Exercise To Students 2020 PDF

Uploaded by

Copyright:

Available Formats

Exercise: IP

1. During each year, 60 workers are available.

2. At most, one building can be started during any year.

3. Building 2 must be completed by the end of year 4.

Building Duration of Project (Years) Number of Workers Required

Product Profit (per unit) Production time (hour per unit)

will be incurred. Formulate a new IP to maximize the profit.

requires a production time of 3 hours instead of 2 hours. Formulate an IP to maximize

(i) At least one of the following two inequalities holds:

(ii) At least two of the following four inequalities hold:

Show how to reformulate these restrictions to fit an MIP model.

with each path is given in the following table.

Path No. Guests on path

ABC Company and each guest are given below.

Formulate an IP model for this problem.

table. The objective is to minimize the total cost.

Production cost of Maximum production

Formulate an IP model for this problem.

for this problem.

Time Needed per Week

Cleaning Cooking Dishwashing Laundry

Eva 4.5 hours 7.8 hours 3.6 hours 2.9 hours

Steve 4.9 hours 7.2 hours 4.3 hours 3.1 hours

problem with integer programming model constraints.

You might also like