MGBEMENE EMMANUEL NNAMDI

U1CS2006
OPERATION RESEARCH
To formulate the problem as a linear programming (LP) problem, we need to define decision variables,
objective function, and constraints.

Decision Variables:

Let's define the decision variables:

X1: the number of litres of product 1 to produce

X2: the number of litres of product 2 to produce

Objective Function:

The objective is to minimize the production cost, which is the total cost of producing product 1 and
product 2.

Z = 200x1 + 300x2

Constraints:

1. Total production of product 1 and product 2:

x1 + x2 ≥ 350

2. Processing time constraint:

2x1 + x2 ≤ 600

3. Non-negativity constraint:

x1, x2 ≥0

Putting everything together, the LP problem can be formulated as follows:

Z = 200x1 + 300x2

Subject to:

x1 + x2 ≥ 350

2x1 + x2 ≥ 600

x1, x2 ≥ 0

This formulation ensures that the company meets the minimum combined production requirement
while also adhering to the processing time constraint and non-negativity constraints. The objective is to
minimize the total production cost of the two products.
This formulation ensures that the company meets the minimum combined production requirement
while also adhering to the processing time constraint and non-negativity constraints. The objective is to
minimize the total production cost of the two products.