Sie sind auf Seite 1von 13

# PROBLEM MIX MODEL

A company manufactures two bottling machines X, and Y. X is designed for 5-ounce bottles, and Y for 10ounce bottles. However, each can be used on both types with some loss of efficiency. The following data are
available:
Machine

5-ounce bottles

10-ounce bottles

80 bottles/min

30 bottles/min

40 bottles/min

50 bottles/min

The machines can be run 8 hours per day, for 5 days a week.
Profit on 5-ounce bottle is 20 paise, and on 10-ounce bottle is , 30 paise.
Weekly production of the drink cannot exceed 500,000 ounces; and,
the market can absorb 30,000 (5-ounce) bottles and 8,000 (10-ounce) bottles per week.
The company wishes to maximize its profit, subject to all the production and marketing constraints.

## PROBLEM MIX MODEL

STEP 1: Decision Variables
To determine the number of 5-ounce bottles and 10-ounce bottles to be produced per week.
Let x1 and x2 represent, the number of 5-ounce and 10-ounce bottles to be produced per week.
STEP 2: Objective Funtion
The objective is to maximize the profit, that is,
Maximize z = Rs. (0.20 x1 + 0.30 x2)

## PROBLEM MIX MODEL

STEP 3:
Constraints can be formulated as:
1.

Since, a 5-ounce bottle takes 1/80 minutes and, a 10-ounce bottle takes 1/30 minutes on machine X, and
the machine can run for 8 hours per day and 5 days per week, the time constraint on machine X is
x1 / 80 + x2 / 30 2400

2.

## Similarly time constraint on machine Y is

x1 / 40 + x2 / 50 2400

3.

(as 8x60x5=2400)

(as 8x60x5=2400)

## As the total weekly production of drink cannot exceed 500,000 ounces,

5 x1 + 10 x2 500,000

4.

x1 30,000
x2 8,000 bottles

## PROBLEM MIX MODEL

The Complete Model is,
Maximize z = Rs. (0.20 x1 + 0.30 x2)
Subject to
x1 / 80 + x2 / 30 2400
x1 / 40 + x2 / 50 2400
5 x1 + 10 x2 500,000
x1 30,000 , x2 8,000 bottles

## PRODUCTION ALLOCATION MODEL

A company manufactures two types of products, A and B and, sells them at a profit of Rs. 4 on type A and Rs. 5
on type B. Each product is processed on two machines, X and Y. Type A requires, 2 minutes of processing time
on X and 3 minutes on Y. Type B requires 2 minutes on X, and, 2 minutes on Y. The machine, X is available for
not more than 5 hours 30 minutes, while Y is available for 8 hours during any working day. Formulate the
problem as a LP problem.
STEP 1:
To determine the number of type A and of type B to be produced.
Let x1 be, the number of products of type A, and x2 be, the number of products of type B.
STEP 2:
The profit on type A is Rs. 4 per product.
The profit on type B is Rs. 5 per product.

=>
=>

## 4x1 will be the profit on selling x1 units of type A.

5x2 will be the profit on selling x2 units of type B.

## Therefore, total profit on selling x1 units of A, and x2 units of B, is given by:

Maximize z = 4 x1 + 5 x2

## PRODUCTION ALLOCATION MODEL

STEP 3:
Constraints can be formulated as:
1.

Since, machine X takes 2 minutes on type A and 2 minutes on type B, and it is not available for more than
5 hours 30 minutes (i.e., 5x60+30 = 330 minutes), the constraint obtained is
2 x1 + 2 x2 330

2.

(as 5x60+30=330)

Similarly, since the machine Y is available for 8 hours (480 minutes), the constraint obtained is
3 x1 + 2 x2 480

3.

x1 0
x2 0

## PRODUCTION ALLOCATION MODEL

The Complete LP Model is,
Maximize z = 4 x1 + 5 x2
Subject to
2 x1 + 2 x2 330
3 x1 + 2 x2 480
x1, x2 0

DIET PROBLEM
Ozark Farms uses at least 800 lb of special feed daily. The special feed is a mixture of corn and soyabean meal
with the following compositions:
lb per lb of feedstuff
Feedstuff

Protein

Fiber

Cost (\$/lb)

Corn

.09

.02

.30

Soyabean meal

.60

.06

.90

The dietary requirements of the special feed are at leat 30 % protein and at most 5 % fiber.
Ozark Farms wishes to determine the daily minimum-cost feed mix.

DIET PROBLEM
STEP 1:
To determine the number of lb of corn and soyabean in the daily mix.
Let
x1 = lb of corn in the daily mix and
x2 = lb of soyabean in the daily mix
STEP 2:
The cost of the corn is \$ .30 per lb.
The cost of the soyabean is \$ .90 per lb.

=>
.3x1 will be the cost on x1 units of corn.
=>
.9x2 will be the cost on x2 units of soyabean.

Therefore, the objective function seeks to minimize the total daily cost of the feed mix and, is thus expressed
as:
Minimize z = .3 x1 + .9 x2

DIET PROBLEM
STEP 3:
Constraints can be formulated as:
1. Ozark Farms needs at least 800 lb of feed a day, the associated constraint can be expressed as:
x1 + x2 800
2. Protein Dietary Requirement:
amount of protein in per lb of corn = .09 lb
=> amount of protein in x1 lb of corn = .09 x1
amount of protein in per lb of soyabean = .60 lb => amount of protein in x2 lb of soyabean = .60 x2
amount of protein in x1 lb of corn and x2 lb of soyabean = .09 x1 + .60 x2
This quantity should equal at least 30% of the total feed mix (x1+x2) lb; that is
.09 x1 + .60 x2 .3 (x1+x2)
3.

## Fiber Dietary Requirement:

In a similar manner, the fiber constraint is constructed as,
.02 x1 + .06 x2 .05 (x1+x2)

4.

## The non-negativity restrictions are,

DIET PROBLEM
The Complete LP Model is,
Minimize z = .3 x1 + .9 x2
Subject to
x1 + x2 800

0.21 x1 - 0.3 x2 0

0.03 x1 - 0.1 x2 0

x1, x2 0

## .09 x1 + .60 x2 .3 (x1+x2)

.09 x1 + .60 x2 0.3 x1+ 0.3 x2
0.3 x1 - .09 x1 + 0.3 x2 - 0.60 x2 0
0.21 x1 - 0.3 x2 0
.02 x1 + .06 x2 .05 (x1+x2)
.02 x1 + .06 x2 .05 x1 + .05 x2
.05 x1 - .02 x1 + 0.06 x2 - 0.05 x2 0
0.03 x1 - 0.1 x2 0

## REDDY MIKKS MODEL

Reddy Mikks produces both interior and exterior paints from two Raw materials M1 and M2. the following
table provides the basic data of the problem.
tons of raw material per ton of
Exterior Paint

Interior Paint

## Maximum daily Availability (tons)

Raw Material M1

24

Raw Material M2

Profit

5 (1000)

4(1000)

Maximize Z = 5 x1 + 4 x2
6 x1 + 4 x2 24
x1 + 2 x 2 6
- x1 + x 2 1
x2 2
x 1 , x2 0

## REDDY MIKKS MODEL

STEP 1: Decision Variables
To determine the number of tons of Exterior and Interior Paint to be produced per day.
Let x1 and x2 represent, the number of tons of Exterior and Interior paint to be produced per day.
STEP 2: Objective Funtion
Profit on Exterior paint is 5 thousand , and on Interior paint is , 4 thousand dollar.
The objective is to maximize the profit, that is,
Maximize z = Rs. (5 x1 + 4 x2)