Scribd
Upload
97 views12 pages

Aot Notes v1

This document discusses assignment problems in operations research. It defines assignment problems as optimization problems that involve allocating jobs to machines or destinations to origins with the goal of minimizing time or cost. The document outlines different types of assignment problems, including square matrix problems for allocating jobs to machines, maximization problems, non-square matrix problems, problems with restrictions, and traveling salesman problems. It also notes that slack, surplus, and artificial variables will be discussed in the next unit for solving assignment problems.

Uploaded by

S Deva Prasad
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
97 views12 pages

Aot Notes v1

This document discusses assignment problems in operations research. It defines assignment problems as optimization problems that involve allocating jobs to machines or destinations to origins with the goal of minimizing time or cost. The document outlines different types of assignment problems, including square matrix problems for allocating jobs to machines, maximization problems, non-square matrix problems, problems with restrictions, and traveling salesman problems. It also notes that slack, surplus, and artificial variables will be discussed in the next unit for solving assignment problems.

Uploaded by

S Deva Prasad
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Source: Operations Research By A. M. Natarajan, P.

Balasubramani by pearson Unit I

Source: Linear Programming:Theory and Applications By Sharma LP Problems expressed in the general LP model form as

Assignment Problem (Source: Natrajan)

Source: OPERATIONS RESEARCH

By N. K. TIWARI, SHISHIR K. SHANDILYA

1. Define and explain the significance of Slack variable, Surplus variable, Artificial variable in linear programming problem.

Unit II
The optimization problem comes under the class of linear programming model, which looks alike with transportation model with an objective function of minimizing the time or cost of manufacturing the products by allocating one job to one machine or one machine to one job or one destination to one origin or one origin to one destination only. This type of problem is given the name ASSIGNMENT MODEL.

Types in assignment problems are: (i) Assigning the jobs to machines when the problem has square matrix to minimize the time required to complete the jobs. Here the number of rows i.e. jobs are equals to the number of machines i.e. columns. The procedure of solving will be discussed in detail in this section. (ii) The second type is maximization type of assignment problem. Here we have to assign certain jobs to certain facilities to maximize the returns or maximise the effectiveness. (iii) Assignment problem having non-square matrix. Here by adding a dummy row or dummy columns as the case may be, we can convert a non-square matrix into a square matrix and proceed further to solve the problem. (iv) Assignment problem with restrictions. Here restrictions such as a job cannot be done on a certain machine or a job cannot be allocated to a certain facility may be specified. In such cases, we should neglect such cell or give a high penalty to that cell to avoid that cell to enter into the programme. (v) Traveling sales man problem (cyclic type). Here a salesman must tour certain cities starting from his hometown and come back to his hometown after visiting all cities. This type of problem can be solved by Assignment technique.

You might also like