# Assignment Model Solved Examples On Linear

A linear programming model can be used to solve the assignment problem. Consider the example shown in the previous table, to develop a linear programming model.

Let,

x_{11} represent the assignment of operator A to job 1

x_{12} represent the assignment of operator A to job 2

x_{13} represent the assignment of operator A to job 3

x_{21} represent the assignment of operator B to job 1

and so on.

Formulating the equations for the time taken by each operator,

10 x_{11} + 16 x_{12} + 7 x_{13} = time taken by operator A.

9 x_{21} + 17 x_{22} + 6 x_{23} = time taken by operator B.

6 x_{31} + 13 x_{32} + 5 x_{33} = time taken by operator C.

The constraint in this assignment problem is that each operator must be assigned to only one job and similarly, each job must be performed by only one operator. Taking this constraint into account, the constraint equations are as follows:

x_{11} + x_{12} + x_{13}< 1 operator A

x_{21} + x_{22} + x_{23}< 1 operator B

x_{31} + x_{32} + x_{33}< 1 operator C

x_{11} + x_{21} + x_{31} = 1 Job 1

x_{12} + x_{22} + x_{32} = 1 Job 2

x_{13} + x_{23} + x_{33} = 1 Job 3

** Objective function: **The objective function minimizes the time taken to complete all the jobs. Using the cost data table, the following equation can be arrived at:

The objective function is,

Minimize Z = 10 x_{11} + 16 x_{12} + 7 x_{13} +9 x_{21} + 17 x_{22} + 6 x_{23} +6 x_{31} + 13 x_{32} + 5 x_{33}

The linear programming model for the problem will be,

Minimize Z = 10 x_{11} + 16 x_{12} + 7 x_{13} +9 x_{21} + 17 x_{22} + 6 x_{23} +6 x_{31} + 13 x_{32} + 5 x_{33}

subject to constraints

x_{11} + x_{12} + x_{13}< 1 ....................(i)

x_{21} + x_{22} + x_{23}< 1 ....................(ii)

x_{31} + x_{32} + x_{33}< 1 ....................(iii)

x_{11} + x_{12} + x_{13} = 1 ....................(iv)

x_{12} + x_{22} + x_{32} = 1 ....................(v)

x_{13} + x_{23} + x_{33} = 1 ....................(vi)

where, x_{ij}> 0 for i = 1,2,3 and j = 1,2,3.

The problem is solved on a computer, using transportation model in TORA package. The input screen and output screens are shown in the previous and following figures respectively.

**TORA, Input Screen**

**TORA, Output Screen**

The objective function value = 28 mins.

**The Assignment Schedule**

Черт возьми, Мидж! - взорвался Джабба. - Я сказал, что вируса в шифровалке. Тебе надо лечиться от паранойи. В трубке повисло молчание. - Мидж… - Джабба попробовал извиниться.

## Comments