Linear programming (LP) techniques consist of a sequence of steps that leads to an optimal solution to

problems, in cases where an optimum exists.

Linear Programming Model:

 Objective Function: mathematical statement of profit or cost for a given solution

 Decision variables: amounts of either inputs or outputs

 Feasible solution space: the set of all feasible combinations of decision variables as defined by
the constraints

 Constraints: limitations that restrict the available alternatives

 Parameters: numerical values

A company is manufacturing two products A and B. The manufacturing time required to make them, the
profit and capacity available at each work centre are given as follows:

Product Matching Fabrication Assembly Profit per unit

A 1 Hour 5 Hours 3 Hours 80

B 2 Hours 4 Hours 1 Hour 100

Total Capacity 720 Hours 1800 Hours 900 Hours

Maximize, Z = 80x1 + 100x2 subject to the constraints:

x1 + 2x2 ≤ 720

5x1 + 4x2 ≤ 1800

3x1 + x2 ≤ 900

x1 , x2 ≥ 0.

…………………………………………..

A company produces three products P, Q, and R from three raw materials: A, B and C. One unit of
product P requires 2 units of A and 3 units of B. One unit of product Q requires 2 units of B and 5 units of
C and one unit of product R requires 3 units A, 2 units of B and 4 units of C. The company has 8 units of
material A, 10 units of material B and 15 units of material C available to it. Profits per unit of products P,
Q and R are Tk3, Tk.5, and Tk4 respectively. Formulate the program mathematically.
Decision variable Product Types of raw material Profit per Unit (Tk)

A B C

x1 P 2 3 - 3

x2 Q - 2 5 5

x3 R 3 2 4 4

Unit of materials Max 8 10 15

available

Maximize, Z = 3x1 + 5x2 + 4x3 subject to the constraints:

2x1 + 3x3 ≤ 8

3x1 + 2x2 + 2x3 ≤ 10

5x2 + 4x3 ≤ 15

x1 , x2, x3 ≥ 0