Scribd
Upload
201 views

Example 2: Feed Mix Problem

The document describes a trim-loss optimization problem where a company produces paper rolls of different widths by cutting standard 20-foot rolls. The problem aims to minimize trim loss and number of standard rolls needed to fulfill customer orders of 150 rolls of width 5 feet, 200 rolls of width 7 feet, and 300 rolls of width 9 feet. Decision variables represent number of standard rolls cut using different knife settings. The objective is to minimize total trim loss calculated based on lengths wasted in cutting rolls to different widths. Constraints ensure produced quantities meet order amounts.

Uploaded by

MohamedAhmedAbdelaziz
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
201 views

Example 2: Feed Mix Problem

The document describes a trim-loss optimization problem where a company produces paper rolls of different widths by cutting standard 20-foot rolls. The problem aims to minimize trim loss and number of standard rolls needed to fulfill customer orders of 150 rolls of width 5 feet, 200 rolls of width 7 feet, and 300 rolls of width 9 feet. Decision variables represent number of standard rolls cut using different knife settings. The objective is to minimize total trim loss calculated based on lengths wasted in cutting rolls to different widths. Constraints ensure produced quantities meet order amounts.

Uploaded by

MohamedAhmedAbdelaziz
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Example 2: Feed mix problem

A farmer is interested in feeding his cattle at minimum


cost.
Two feeds are used A&B. Each cow must get at least
400 grams/day of protein, at least 800 grams/day of
carbohydrates, and not more than 100 grams/day of
fat. Given that A contains 10% protein, 80%
carbohydrates and 10% fat while B contains 40%
protein, 60% carbohydrates and no fat. A costs 2 $/kg,
and B costs 5 $/kg. Formulate the problem to
determine the optimum amount of each feed to
minimize cost.

1
Problem Formulation
Decision variables

X1= weight of feed A kg/day/animal


X2= weight of feed B kg/day/animal
Objective Function

Minimize Z= 2 X1 + 5 X2
Constraints

Protein 0.1 X1 + 0.4 X2 >=0.4


Carbohydrates 0.8 X1 + 0.6 X2 >=0.8
Fats 0.1 X1 <= 0.1
X 1, >=0
2
Example 3: Blending Problem
An iron ore from 4 mines will be blended. The analysis has shown that, in
order to obtain suitable tensile properties, minimum requirements must be
met for 3 basic elements A, B, and C. Each of the 4 mines contains different
amounts of the 3 elements (see the table). Formulate to find the least cost
blend for one ton of iron ore.

3
Problem Formulation

Decision variables

X1= Fraction of ton to be selected from mine number 1


X2= Fraction of ton to be selected from mine number
2 X3= Fraction of ton to be selected from mine
number 3 X4= Fraction of ton to be selected from
mine number 4

Objective Function

Minimize Z= 800 X1 + 400 X2 + 600 X3 + 500 X4

Constraints 10 X1 + 3 X 2 + 8 X3 + >= 5
904 X1 + 150 X2 + 75 X3 + 175 X4
2X >=
10
45 X11 + 25 X22 + 20 X33 ++ 37 X4 >=
30 X14, X2, X3, X4
=1
4
>= 0
Example 4: Inspection Problem
A company has 2 grades of inspectors 1&2. It is required that at
least 1800 pieces be inspected per 8 hour- day. Grade 1 inspectors can
check pieces at the rate of 25 per hour with an accuracy of 98%.
Grade 2 inspectors can check at the rate of 15 pieces per hour with an
accuracy of 95%. Grade 1 costs 4 L.E/hour, grade 2 costs 3 L.E/hour.
Each time an error is made by an inspector costs the company 2
L.E. There are 8 grade 1 and 10 grade 2 inspectors available. The
company wants to determine the optimal assignment of inspectors
which will minimize the total cost of inspection/day.

5
Problem Formulation

Decision Variables
X1= Number of grade 1 inspectors/day.
X2= Number of grade 2 inspectors/day.

Objective Function
Cost of inspection = Cost of error + Inspector
salary/day
Cost of grade 1/hour = 4 + (2 X 25 X 0.02) = 5 L.E
Cost of grade 2/hour = 3 + (2 X 15 X 0.05) = 4.5 L.E

Minimize Z= 8 (5 X1 + 4.5 X2)


= 40 X1 + 36 X2
Constraints
X1 <= 8
X2 <= 10
8(25) X1+ 8(15) X2 >= 1800
200 X1 + 120 X2 >= 1800
X 1, X2 >=0
6
Example 5: Trim-loss Problem.
A company produces paper rolls with a standard width of 20 feet.
Each special customer orders with different widths are produced by
slitting the standard rolls. Typical orders are summarized in the
following tables.

Possible knife settings

7
Formulate to minimize the trim loss and the number of rolls
needed to satisfy the order.

8
Problem Formulation
Decision variables
Xj = Number of standard rolls to be cut according to setting j
j = 1, 2, 3, 4, 5, 6
Number of 5 feet rolls produced = 2 X2 + 2 X3 + 4 X4 + X5
Number of 7 feet rolls produced = X1 + X2+ 2 X5
Number of 9 feet rolls produced = X1 + X3+ 2 X6
Let Y1, Y2, Y3 be the number of surplus rolls of the 5, 7,
9 feet rolls thus
Y1= 2 X2 + 2 X3 + 4 X4 + X5 - 150
Y2= X1 + X2+ 2 X5 - 200
Y3= X1 + X3+ 2 X6 - 300
The total trim losses = L (4X1 +3 X2+ X3 + X5 + 2 X6 + 5Y1+ 7Y2+
9Y3) Where L is the length of the standard roll.
Objective Function
Minimize Z= L(4X1 +32X2+ X2+ X3
2 X+3+ 4 X4+ XX5 - Y1 7Y2+ 9Y3)
5 + 2 X6 + 5Y1+ = 150
Constraints X1 + X2 +2X5 - Y2 = 200
X1 + X3 + 2 X6 - Y3 = 300
X1, X2, X3, X4, X5, X6 >= 0
Y1, Y2, Y3 >= 0
9
General form of a LP problem with m constraints and n
decision variables is:

Maximize Z = C1X1+ C2X2+ …………………. + CnXn

Constraints

+ A12X2+……………………+ A1nXn <= B1


A11X1
+ A22X2+……………………+ A2nXn <= B2
A21X1
.
.
.
. + Am2X2+……………………+ AmnXn <= Bm
Am1X1
X1, X2, ……………………………………, Xn >= 0

10
OR

Maximize Z= Σnj=1 CjXj

Constraints
<= bi Xi >=0 i = 1, …., m j = 1, ….,
Σnj=1 aijXi
n
Where
n = Number of activities.
Xj = Level of activity j
Cj =Contribution of the objective function/unit of activity j
m = Number of resources
Bi = Amount of resource i available.
Aij=Amount of resource i consumed by one unit of
activity j

1. forms
Other Minimize Z= Σ j=1 CjXj
n

2. Σn A X >= B for some values of i


j=1 ij i i
3. for some values of
n
4. ΣXj=1
i
AijXi = Bi i
unrestricted in sign for 11

You might also like