Return to Index
Operations Research Models and Methods
 
Problems Section
Problems for Linear Programming Models
- Product Mix for A, B and C

Define variables

A, B, C = Amount of products A, B and C processed.

AS , BS, CS = Amount of products A, B and C Sold.

AB the amount of A used for production of B.

BC the amount of B used for production of C

R1, R2 and R3 amounts of raw materials 1, 2 and 3 used.

Objective is to maximize profit.

Z = 100AS + 350BS + 500CS - 50R1 - 20R2 - 40R3

Constraints describe conservation of flow

Process A:

AS + AB - A = 0

Process B:

BS + BC - B = 0

Process C:

CS - C = 0

RM 1:

A + B + 0.3C - R1 = 0

RM2

0.6B + 0.2C - R2 = 0

RM3

C - R3 = 0

A in B:

AB - 2B = 0

B in C:

BC - 1.2C = 0.

 

Simple upper bounds limit production

0 AS 100, 0 BS 150, 0 CS 200

Simple upper bounds imit raw material purchases

0 R1 200, 0 R2 150, 0 R3 200


  
Return to Top

tree roots

Operations Research Models and Methods
Internet
by Paul A. Jensen
Copyright 2004 - All rights reserved