Assignment problems, Operation Research

Assignment Help:
Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment?

6 2 5 2 6
2 5 8 7 7
7 8 6 9 8
6 2 3 4 5
9 3 8 9 7
4 7 4 6 8

Related Discussions:- Assignment problems

Applications of statistics in management, In a business, statis...

In a business, statistics is used to study the demand and market characteristics of the product or service being sold. In fact, market research

Production and operations management., layout of any retailer shop and the ...

layout of any retailer shop and the reasons for the layout

Short question, write down any two assumption of L.P

write down any two assumption of L.P

Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 =...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X 1, X2 = 0

LLp, A paper mill produces two grades of paper viz., X and Y. Because of ra...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Mean deviation - measure of dispersion, MEAN DEVIATION Mean  deviati...

MEAN DEVIATION Mean  deviation of a series is the arithmetic  average of the  deviations of various  items  from the  median  or mean  of that series. Median is preferred

Linear programming, nass food produces to kinds of popular dark chocolate b...

nass food produces to kinds of popular dark chocolate bars.the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where as the coffee bar costs 0.40 to make an

Report writing - report writing presentation, REPORT WRITING The final...

REPORT WRITING The final step in research is to report the study  findings to those  who authorized the investigation. The American marketing association is  of the opinion  t

Solve the following linear programming graphically, Problem based on graphi...

Problem based on graphical solution of a given LPP when feasible region is bounded. 1.    Solve the following linear programming graphically; Maximize and minimize z = 60x+

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

Patil Yogesh

7/8/2013 9:15:52 AM

Please sent me ANS

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd