Scribd
Upload
36 views

Assignment 6

The document describes three integer programming problems: 1) A truck loading problem to maximize total worth given weight, volume, and value constraints. 2) A production planning problem to minimize total cost given machine setup costs and production capacities. 3) An integer programming problem to maximize an objective function subject to constraints, along with a branch and bound tree showing the solution process.

Uploaded by

mood13
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views

Assignment 6

The document describes three integer programming problems: 1) A truck loading problem to maximize total worth given weight, volume, and value constraints. 2) A production planning problem to minimize total cost given machine setup costs and production capacities. 3) An integer programming problem to maximize an objective function subject to constraints, along with a branch and bound tree showing the solution process.

Uploaded by

mood13
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

IE311: Operations Research I – Spring 2022

IE311: Operations Research I


Assignment 5: Integer Programming + Goal Programming

Part I: Integer Programming

Problem 1:
Five items might be loaded in a truck. The weight wi, volume vi, and value ri for item i are
tabulated below. The maximum allowable cargo weight and volume are 9 tons and 16 m3,
respectively. Formulate an IP model to maximize total worth.

Item i Weight, wi (tons) Volume, vi (m3) Worth, ri ($)


1 2.5 1 4
2 4 8 7
3 1.5 6 6
4 1 5 5
5 3.5 4 4

Problem 2:
Jobco is planning to produce at least 1500 widgets on three available machines. If a machine is
used, a setup cost will be added. The following table gives the pertinent data of the situation.
Formulate the problem as an IP to minimize total cost.

Machin Setup cost ($) Production Capacity (units)


e cost/unit ($)
1 300 2 650
2 100 10 850
3 200 5 1250
IE311: Operations Research I – Spring 2022

Problem 3:

Consider the following IP problem:

Max z = 8 x1 + 5 x2
Subject to
x1 + x2 ≤ 6
9 x1 + 5 x2 ≤ 45
x1, x2 ≥ 0; and integers

The following figure shows the branch and bound tree for the IP problem, where t is the order of
solving the subproblems:

Answer the following:


a) For each subproblem identify the reason for branching or fathoming the subproblem.
b) Write the complete LP model for subproblem 5.
c) What is the optimal solution for the IP problem?

You might also like