Scribd
Upload
52 views8 pages

Integer Binaray Programming

The document presents an optimization problem to determine the optimal number of different food items (pizza slices, hotdogs, and BBQ sandwiches) to sell at a food booth. It aims to minimize total costs while adhering to constraints on available food space, capital budget, and required sales levels. Decision variables are defined for each food item and the objective function accounts for selling prices, fixed costs, and variable costs to determine overall profit. Constraints specify limits on usable space, capital budget, and required sales levels that must be met.

Uploaded by

terencejustine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
52 views8 pages

Integer Binaray Programming

The document presents an optimization problem to determine the optimal number of different food items (pizza slices, hotdogs, and BBQ sandwiches) to sell at a food booth. It aims to minimize total costs while adhering to constraints on available food space, capital budget, and required sales levels. Decision variables are defined for each food item and the objective function accounts for selling prices, fixed costs, and variable costs to determine overall profit. Constraints specify limits on usable space, capital budget, and required sales levels that must be met.

Uploaded by

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

Let:

X1 be the number of Project A to fund


X2 be the number of Project B to fund
X3 be the number of Project C to fund
X4 be the number of Project D to fund
X5 be the number of Project E to fund
X6 be the number of Project F to fund
X7 be the number of Project G to fund
X8 be the number of Project H to fund

X1 X2 X3 X4 X5
Decision Variables 1 1 1 1 1

Objective Function
Maximize Value 40 10 80 50 20

Constraints
Budget 80 15 120 65 20
Project G and H
Project D and A 1 1

G+H <= 1
D <= A
X6 X7 X8
1 0 1

Maximize
5 80 100 305

Used <=> Limits Difference


10 60 100 410 <= 320000
1 1 1 <= 1
1 <= 1
Let:
X1 be Project A to be undertaken by ABC Construction Company
X2 be Project B to be undertaken by ABC Construction Company
X3 be Project C to be undertaken by ABC Construction Company
X4 be Project D to be undertaken by ABC Construction Company

X1 X2 X3 X4
Decision Variables 1 0 0 1

Objective Function
Maximize Present Value 1,800,000 200,000 720,000 800,000

Constraints
Year 1 300,000 120,000 300,000 200,000
Year 2 400,000 80,000 200,000 400,000
Year 3 400,000 - 200,000 400,000
Year 4 200,000 40,000 200,000 100,000
Maximize
2,600,000

Used <=> Limits Difference


500,000 <= 650,000
800,000 <= 800,000
800,000 <= 800,000
300,000 <= 500,000
Let:
X1 be Machine 1
X2 be Machine 2
X3 be Machine 3
Y1 be the number of units to be produced
Y2
Y3

X1 X2 X3 Y1
Decision Variables 0 0 0 0

Objective Function
Setup Cost 9,000 6,000 4,500
Unit Cost 11
Total Cost

Constraints
Max Production
1 1
1
1
Y2 Y3
5000 0

Minimize

10 16
50000.0000012

Used <=> Limits Difference


5,000 >= 5,000
- = 2
1 - = 2
1 - = 2
Let:
X1 be the number of pizza slices to be sold
X2 be the number of hotdogs to be sold
X3 be the number of BBQ sandwich to be sold
pizza hotdog bbq
X1 X2 X3
Decision Variables 126 42 84

Objective Function Minimize


Selling Price 12.00 1.50 2.25
Fixed Cost - Oven 600.00
Fixed Cost - Booth Rental 1,000
Variable Cost 6.00 0.45 0.90
Profit (686.50)

Constraints Used
Food Space 196 16 25 27,468
Capital 6.00 0.45 0.90 851
Pizza Sales 1 (1) (1) 0
Sales - 2 (1) -
<=> Limits Difference
<= 27,648
<= 1,500
= -
= -

You might also like