CHAPTER 5 A NEW ALTERNATE METHOD OF ASSIGNMENT PROBLEM
|
|
- Laura Cross
- 7 years ago
- Views:
Transcription
1 69 CHAPTER 5 A NEW ALTERNATE METHOD OF ASSIGNMENT PROBLEM 5.1 Introduction An assignment problem is a particular case of transportation problem where the objective is to assign a number of resources to an equal number of activities so as to minimize total cost or maximize total profit of allocation. The problem of assignment arises because available resources such as men, machines, etc. have varying degrees of efficiency for performing different activities. Therefore, cost, profit or time of performing the different activities is different. Thus, the problem is how the assignments should be made so as to optimize the given objective. The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in Mathematics. It consists of finding a maximum weight matching in a weighted bipartite graph. In general, the assignment problem is of following type: There are a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost that may vary depending on the agent-task assignment. In such problem, it is required to perform all tasks by assigning exactly one agent to each task in such a way that the total cost of the assignment is minimized. If the numbers of agents and tasks are equal and the total cost of the assignment for all tasks is equal to the sum of the costs for each agent (or the sum of the costs for each task, which is the same thing in this case), then the problem is called the linear assignment problem. Commonly, when speaking of the assignment problem without any additional qualification, then the linear assignment problem is meant.
2 70 Suppose that a taxi firm has three taxis (the agents) available, and three customers (the tasks) wishing to be picked up as soon as possible. The firm prides itself on speedy pickups, so for each taxi the "cost" of picking up a particular customer will depend on the time taken for the taxi to reach the pickup point. The solution to the assignment problem will be whichever combination of taxis and customers results in the least total cost. However, the assignment problem can be made rather more flexible than it first appears. In the above example, suppose that there are four taxis available, but still only three customers. Then a fourth dummy task can be invented, perhaps called "sitting still doing nothing", with a cost of 0 for the taxi assigned to it. The assignment problem can then be solved in the usual way and still give the best solution to the problem. Similar tricks can be played in order to allow more tasks than agents, tasks to which multiple agents must be assigned (for instance, a group of more customers than will fit in one taxi), or maximizing profit rather than minimizing cost. So far in the literature, there are mainly four methods so called Enumeration Method, Simplex Method, Transportation Method and Hungarian Method for solving Assignment Problem. Out of which Hungarian method is one of the best available for solving an assignment problem. Hungarian mathematician Konig (1931) developed the Hungarian method of assignment which provides us an efficient method of finding the optimal solution without having to make a direct comparison of every solution. It works on the principle of reducing the given cost matrix to a matrix of opportunity costs. Opportunity costs show the relative penalties associated with assigning resource to an activity as opposed to making the best or least cost assignment. If we can reduce the cost matrix to the extent of having at least one zero in each row and column, it will be possible to make optimal assignments (opportunity costs are all zero). The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal-dual methods. Kuhn (1955) further developed the assignment problem which has been as "Hungarian method" because the algorithm was largely based
3 71 on the earlier works of two Hungarian mathematicians: Dénes Kınig and Jenı Egerváry. Ford and Fulkerson (1956) extended the method to general transportation problems. Munkres (1957) reviewed the algorithm and observed that it is strongly polynomial. Since then the algorithm has been known also as Kuhn Munkres algorithm or Munkres assignment algorithm. The time complexity of the original algorithm was O (n 4 ), however Edmonds and Karp (1972) studied the theoretical improvements in algorithmic efficiency for network flow problems while Tomizawa (1990b) studied polynomial diagonal-parameter symmetry model for a square contingency table however both of them independently noticed that it can be modified to achieve an O(n 3 ) running time. In 2006, it was discovered that Carl Gustav Jacobi (1890) had solved the assignment problem in the 19th century but it was not published during his tenure however it was published posthumously in 1890 in Latin. Jacobi (1890) developed the concept of assignment algorithm. Thompson (1981) discussed a recursive method for solving assignment problem which is a polynomially bounded non simplex method for solving assignment problem. Li and Smith (1995) discuss an algorithm for Quadratic assignment problem. Ji et. al. (1997) discussed a new algorithm for the assignment problem which they also called an alternative to the Hungarian Method. There assignment algorithm is based on a 2n*2n matrix where operations are performed on the matrix until an optimal solution is found. In this chapter, we have developed an alternative method for solving an assignment problem to achieve the optimal solution. It has been found that the optimal solution obtained in this method is same as that of Hungarian method. 5.2 Mathematical Statement of the Problem Given n resources (or facilities) and n activities (or jobs), and effectiveness (in terms of cost, profit, time, etc.) of each resource (facility) for each activity (job),
4 72 the problem lies in assigning each resource to one and only one activity (job) so that the given measure of effectiveness is optimized. The data matrix for this problem is shown in Table 5.1. Table 5.1 Data Matrix Resources (workers) J 1 J 2 Activities(jobs) K J n W 1 c 11 c 12 K c 1n 1 W 2 c 21 c 22 K c 2n 1 M M M M M W n c n1 c n2 K c nn 1 Demand 1 1 K 1 n Supply From Table 5.1, it may be noted that the data matrix is the same as the transportation cost matrix except that supply (or availability) of each of the resources and the demand at each of the destinations is taken to be one. It is due to this fact that assignments are made on a one-to-one basis. Let x ij denote the assignment of facility i to job j such that x ij = 1 0 if facility i is assigned tojobj otherwise Then, the mathematical model of the assignment problem can be stated as: The objective function is to, Subject to the constraints n j= 1 n i= 1 x x ij ij Minimise Z = c ij x ij = 1, foralli = 1, forall n n i= 1 j= 1 ( resource availability) j ( activity requirement)
5 73 Where, x ij =0 or 1 and c ij represents the cost of assignment of resource i to activity j. From the above discussion, it is clear that the assignment problem is a variation of the transportation problem with two characteristics: (i) the cost matrix is a square matrix, and (ii) the optimal solution for the problem would always be such that there would be only one assignment in a given row or column of the cost matrix. 5.3 Solution of the Assignment Problem So far, in the literature it is available that an assignment problem can be solved by the following four methods. I. Enumeration method II. Simplex method III. Transportation method IV. Hungarian method Here, we discuss each of four, one by one. I. Enumeration method In this method, a list of all possible assignments among the given resources (like men, machines, etc.) and activities (like jobs, sales areas, etc.) is prepared. Then an assignment involving the minimum cost (or maximum profit), time or distance is selected. If two or more assignments have the same minimum cost (or maximum profit), time or distance, the problem has multiple optimal solutions. In general, if an assignment problem involves n workers/jobs, then there are in total n! Possible assignments. As an example, for an n=3 workers/jobs problem, we have to evaluate a total of 3! or 6 assignments. However, when n is large, the method is unsuitable for manual calculations. Hence, this method is suitable only for small n.
6 74 II. Simplex Method Since each assignment problem can be formulated as a 0 or 1 which becomes integer linear programming problem. Such a problem can be solved by the simplex method also. As can be seen in the general mathematical formulation of the assignment problem, there are n n decision variables and n+n or 2n equalities. In particular, for a problem involving 5 workers/jobs, there will be 25 decision variables and 10 equalities. It is, again, difficult to solve manually. III. Transportation Method Since an assignment problem is a special case of the transportation problem, it can also be solved by transportation methods. However, every basic feasible solution of a general assignment problem having a square payoff matrix of order n should have more m+n-1= n+n-1= 2n-1 assignments. But due to the special structure of this problem, any solution cannot have more than n assignments. Thus, the assignment problem is inherently degenerate. In order to remove degeneracy, (n-1) number of dummy allocations will be required in order to proceed with the transportation method. Thus, the problem of degeneracy at each solution makes the transportation method computationally inefficient for solving an assignment problem. IV. Hungarian Method Assignment problems can be formulated with techniques of linear programming and transportation problems. As it has a special structure, it is solved by the special method called Hungarian method. This method was developed by D. Konig, a Hungarian mathematician and is therefore known as the Hungarian method of assignment problem. In order to use this method, one needs to know only the cost of making all the possible assignments. Each assignment problem has a matrix (table) associated with it. Normally, the objects (or people) one wishes to assign are expressed in rows, whereas the columns represent the tasks (or things) assigned to them. The number in the table would then be the costs associated with each particular assignment. It may be noted that the
7 75 assignment problem is a variation of transportation problem with two characteristics. (i) The cost matrix is a square matrix, and (ii) The optimum solution for the problem would be such that there would be only one assignment in a row or column of the cost matrix. Hungarian method is based on the principle that if a constant is added to the elements of cost matrix, the optimum solution of the assignment problem is the same as the original problem. Original cost matrix is reduced to another cost matrix by adding a constant value to the elements of rows and columns of cost matrix where the total completion time or total cost of an assignment is zero. This assignment is also referred as the optimum solution since the optimum solution remains unchanged after the reduction. Hungarian Method (minimization case) can be summarized in the following steps: Step 1 Develop the cost table from the given problem If the number of rows is not equal to the number of columns and vice versa, a dummy row or dummy column must be added. The assignment costs for dummy cells are always zero. Step 2 Find the opportunity cost table (a) Locate the smallest element in each row of the given cost table and then subtract that from each element of that row, and (b) In the reduced matrix obtained from 2(a), locate the smallest element in each column and then subtract that from each element of that column. Each row and column now have at least one zero value. Step 3 Make assignments in the opportunity cost matrix The procedure of making assignments is as follows: (a) Examine rows successively until a row with exactly one unmarked zero is obtained. Make an assignment to this single zero by making a square around it. (b) For each zero value that become assigned, eliminate (strike off) all other zeros in the same row and/or column.
8 76 (c) Repeat Steps 3(a) and 3(b) for each column also with exactly single zero value cells that have not been assigned. (d) If a row and/or column have two or more unmarked zeros and one cannot be chosen by inspection, then choose the assigned zero cell arbitrarily. (e) Continue this process until all zeros in rows/columns are either enclosed(assigned) or struck off( ) Step 4 Optimality criterion If the number of assigned cells is equal to the number of rows/columns, then it is an optimal solution. The total cost associated with this solution is obtained by adding original cost figures in the occupied cells. If a zero cell was chosen arbitrarily in Step 3, there exists an alternative optimal solution. But if no optimal solution is found, then go to Step 5. Step 5 Revise the opportunity cost table Draw a set of horizontal and vertical lines to cover all the zeros in the revised cost table obtained from Step 3, by using the following procedure: (a) For each row in which no assignment was made, mark a tick( ) (b) Examine the marked rows. If any zero cells occur in those rows, mark to the respective columns that contain those zeros. (c) Examine marked columns. If any assigned zero occurs in those columns, tick the respective rows that contain those assigned zeros. (d) Repeat this process until no more rows or columns can be marked. (e) Draw a straight line through each marked column and each unmarked row. If the number of lines drawn (or total assignments) is equal to the number of rows (or columns), the current solution is the optimal solution, otherwise go to Step 6. Step 6 Develop the new revised opportunity cost table (a) From among the cells not covered by any line, choose the smallest element. Call this value k. (b) Subtract k from every element in the cell not covered by a line. (c) Add k to every element in the cell covered by the two lines, i.e. intersection of two lines.
9 77 (d) Elements in cells covered by one line remain unchanged. Step 7 Repeat Steps 3 to 6 until an optimal solution is obtained Solution of Assignment Problem using Hungarian Method Example A department has five employees with five jobs to be performed. The time (in hours) each men will take to perform each job is given in the effectiveness matrix. Jobs Table 5.2 Employees I II III IV V A B C D E How should the jobs be allocated, one per employee, so as to minimize the total man-hours? (Refer Sharma, 2007) Solution Here I solve this example using only Hungarian Method because other three methods are not mostly used for solving an assignment problem. And then I show that how our method is better than Hungarian Method. Applying step 2 of the algorithm, we get the reduced opportunity time matrix as shown in Table 5.3. Steps 3 and 4 Table 5.3 I II III IV V A B C D E (a) We examine all the rows starting from A one-by-one until a row containing only single zero element is located. Here rows A, B and E have only one zero
10 78 element in the cells (A, II), (B,I) and (E,IV). Assignment is made in these cells. All zeros in the assigned columns are now crossed off as shown in Table 5.4. (b) We now examine each column starting from column 1. There is one zero in column III, cell (C, III). Assignment is made in this cell. Thus cell (C, V) is crossed off. All zeros in the table now are either assigned or crossed off as shown in Table 5.4. Table 5.4 I II III IV V A B C D E The solution is not optimal because only four assignments are made. Step 5 Cover the zeros with minimum number of lines (=4) as explained below: (a) Mark ( ) row D since it has no assignment. (b) Mark ( ) columns I and IV since row D has zero element in these columns. (c) Mark ( ) rows B and E since columns I and IV have an assignment in rows B and E, respectively. (d) Since no other rows or columns can be marked, draw straight lines through the unmarked rows A and C and the marked columns I and IV, as shown in Table 5.5. Table 5.5 I II III IV V A B C D E Step 6
11 79 Develop the new revised table by selecting the smallest element among all uncovered elements by the lines in Table 3; viz. 2. Subtract k=2 from uncovered elements including itself and add it to elements 5,10,8 and 0 in cells (A, I), (A, IV), (C, I) and (C, IV), respectively which lie at the intersection of two lines. Another revised table so obtained is shown in Table 5.6. Table 5.6 I II III IV V A B C D E Step 7 Repeat Steps 3 to 6 to find a new solution. The new assignment is shown in Table 5.7. Table 5.7 I II III IV V A B C D E Since the number of assignments (=5) equals the number of rows (or columns), the solution is optimal. The pattern of assignments among jobs and employees with their respective time (in hours) is given below.
12 80 Job Employee Time (in hours) A II 5 B I 3 C V 2 D III 9 E IV 4 Total 23 hours The Hungarian method has many steps to solve the problem so many times it will be very complicated. So we illustrated a very easy method to solve the assignment problem. 5.4 A NEW ALTERNATE METHOD OF ASSIGNMENT PROBLEM The new alternate method of assignment problem discussed here gives optimal solution directly within few steps. It is very easy to calculate and understand. The alternate method developed by us in this investigation seems to be easiest as compare to available methods of assignment problem. Here we explain algorithm for alternate method of solving assignment problem for minimization and maximization cases Algorithm for Minimization Case Let A, B, C Z denote resources and I, II, III, IV denote the activities. Now we discussed various steps for solving assignment problem which are following. Step 1 Construct the data matrix of the assignment problem. Consider row as a worker (resource) and column as a job (activity). Step 2 Write two columns, where column 1 represents resource and column 2 represents an activity. Under column 1, write the resource, say, A, B, C Z.
13 81 Next find minimum unit cost for each row, whichever minimum value is available in the respecting column, select it and write it in term of activities under column 2. Continue this process for all the Z rows and write in term of I, II Step 3 Let for each resource; if there is unique activity then assigned that activity for the corresponding resource, hence we achieved our optimal solution. For example, let we have 5 resources A, B, C, D, E and 5 activities I, II, III, IV, V. This is shown in Table 5.8. Table 5.8 Column 1 Column 2 Resource Activity A V B III C I D IV E II If there is no unique activity for corresponding resources (which is shown in Example and Example ) then the assignment can be made using following given steps: Step 4 Look at which of any one resource has unique activity and then assign that activity for the corresponding resource. Next delete that row and its corresponding column for which resource has already been assigned. Step 5 Again find the minimum unit cost for the remaining rows. Check if it satisfy step 4 then perform it. Otherwise, check which rows have only one same activity. Next find difference between minimum and next minimum unit cost for all those rows which have same activity. Assign that activity which has maximum difference. Delete those rows and corresponding columns for which those resources have been assigned.
14 82 Remarks 1 However if there is tie in difference for two and more than two activity then further take the difference between minimum and next to next minimum unit cost. Next check which activity has maximum difference, assign that activity. Step 6 Repeat steps 4 to 5 till all jobs are assigned uniquely to the corresponding activity. Step 7 Once all the jobs are assigned then calculate the total cost by using the expression, Total cost = c ij x ij n n i= 1 j= Numerical Examples In this chapter, we illustrate some numerical examples to solve the assignment problem using New Alternate Method. Example A computer centre has five expert programmers. The centre needs five application programs to be developed. The head of the computer centre, after studying carefully the programs to be developed. Estimate the computer time in minutes required by the experts for the application programs. The observations are shown in Table 5.9. Table 5.9 Data matrix Programmers Programs I II III IV V A B C D E Assign the programmers to the programs in such a way that the total computer time is minimum. Solution Consider Table 5.9, Select row A, where the minimum value is 60 representing program III. Similarly, the minimum value for row-b to row-e are 70,
15 83 110, 85 and 100 representing programs I, II, V and IV respectively. This is shown in Table Table 5.10 Table 5.10a Programmers Programs Programmers Programs A III I II III IV V B I A C II B D V C E IV D E From Table 5.10, we can easily see that different programs are meant for different programmers. That is, we can assign programs uniquely to the programmers, which is shown in Table 5.10a and hence we achieved our optimal solution, which is shown in Table Table 5.11 Programs Programmers Time I B 70 II C 110 III A 60 IV E 100 V D 85 Total 425 Result This answer is happened to be same as that of Hungarian method. Hence we can say that the minimum time is still 425 in both the methods. So our method also gives Optimal Solution. However our method seems to be very simple, easy and takes very few steps in solving the method.
16 84 Now we consider another example where (i) different resources do not have unique activity and (ii) resource has more than one minimum cost. This is discussed in Example Example The department has five employees with five jobs to be performed. The time (in hours) each men will take to perform each job is given in the effectiveness matrix. Resources (Employees) Table 5.12 Data matrix Activities(jobs) I II III IV V A B C D E Solution Consider the data matrix Now, we select row A and select that column (activity) for which row A has minimum unit cost. In this example, for row A, column II (activity) has the minimum unit cast. So we write resource A under column I and activity II under column II. In the similar way, we select all the rows (resources) and find the minimum unit cost for the respective columns, which are shown in Table Resource A B C D E Table 5.13 Table 5.13a Activity II I III, IV, V I, IV IV I II III IV V A B C D E Here, Activity II is unique as it doesn t occur again and hence assigned resource A to activity II and is shown in Table 5.13a. Next, delete Row A and Column II.
17 85 Again select minimum cost value for the remaining resources, B, C, D and E. which is shown below Table Table 5.14 Table 5.14a Resource Activity I III IV V B I B C III, IV, V C D I, IV D E IV E Since resource B has single activity I. Next we see that resource D has also activity I and hence we take the minimum unit cost difference for resource B and D. Here minimum cost difference for resource B is 3(6-3) while minimum cost difference for resource D is 0(7-7). Since 3 is the maximum difference which represents resource B and hence assign resource B to activity I and is shown in Table 5.14a. Further delete row B and Column I. Again select minimum unit cost for the remaining resources, C, D and E. which is shown in Table Resource C D E Table 5.15 Table 5.15a Activity III, IV, V IV IV Since resource D and E have single activity IV. Next we see that resource C has also same activity IV and hence we take the minimum cost difference for resources C, D and E. Here minimum cost difference for resource C is 0, minimum cost difference for resource D is 2 while minimum cost difference for resource E is 6. Since 6 is a maximum difference which represents resource E and hence assign resource E to activity IV and is shown in Table 4.15a. Further delete row E and Column IV. III IV V C D E
18 86 Again select minimum cost value for the remaining resources, C and D. which is shown in Table Resource C D Table 5.16 Table 5.16a Activity III, V III Since resource D has single activity III. Next we see that resource C has also same activity III and hence we take the minimum cost difference for resources C and D. Here minimum cost difference for C is 0, while minimum cost difference for D is 3. Since 3 is the maximum difference which represents resource D and hence assign resource D to activity III. Finally only row C and column V remains and hence assign resource C to activity V and is shown in Table 4.16a. Finally, different employees have assigned jobs uniquely, which is shown in Table Table 5.17 Employees Jobs Time (in hour) A II 5 B I 3 C V 2 D III 9 E IV 4 Total 23 III V C 2 2 D 9 12 Result This answer is happened to be same as that of Hungarian method. Hence we can say that the minimum value is still 23 in both the methods. So our method also gives Optimal Solution. However our method seems to be very simple, easy and takes very few steps in solving the problem. Next we consider another example where different resources do not have unique activity but each resource has only one minimum unit cost. This is discussing in Example
19 87 Example A factory has six machines and employed six workers to work on the given six machines. Based on the workers experience and their personal efficiency, the workers have assigned to work on six machines. Following is the times (minutes) taken by workers in completion of that work in the respective machines. The times are as follow. Table 5.18 Data matrix Machine I II III IV V VI A B Workers C D E F Obtain optimal assignment of the workers. Solution Consider the data matrix Now, we select row A and select that column (activity) for which row A has minimum value. In this example, for row A, column V (activity) has the minimum value. So we write resource A under column I and activity V under column II. In the similar way, we select all the rows (resources) and find the minimum value for the respective columns. This is shown in Table Table 5.19 Table 5.19a Column 1 Column 2 I II III IV V VI A V A B III B C V C D V D E I F I E F Here, Activity III is unique as it doesn t occur again and hence assigned resource B to activity III and is shown in Table 5.19a. Next, delete Row B and Column III.
20 88 Again select minimum cost value for the remaining resources, A, C, D, E and F. which is shown below Table Table 5.20 Table 5.20a Column 1 Column 2 I II IV V VI A V A C V C D V D E I E F I F Since resource A has single activity V. Next we see that resource C and D have also activity V and hence take the minimum cost difference for resource A, C and D. Here minimum cost difference for resource A is 2, for resource C is 2, while minimum cost difference for resource D is 3. Since 3 is the maximum difference which represents resource D and hence assign resource D to activity V and is shown in Table 5.20a. Again resource E has single activity I. Next we see that resource F has also same activity I and hence we take the minimum cost difference for resource E and F. Here minimum cost difference for resource E is 2 while minimum cost difference for resource F is also 2. So we will find next minimum difference for resource E and F which comes out as 2 and 1 for E and F respectively. Since 2 is the maximum difference which represents resource E and hence assign resource E to activity I and is shown in Table 3a. Further delete (i) row D and Column V and (ii) row E and Column I. Again select minimum unit cost for the remaining resources, A, C and F. which is shown below Table Table 5.21 Table 5.21a Column 1 Column 2 II IV VI A IV A C IV C F II F Since resource F has unique single activity II and hence assigned resource F to activity II shown in Table 5.21a. Further delete row F and Column II. Again select
21 89 minimum unit cost for the remaining resources, A and C. which is shown in Table Table 5.22 Table 5.22a Column 1 Column 2 IV VI A IV A 5 10 C IV C 6 12 Since resource A has single activity IV. Next we see that resource C has also same activity IV and hence take the minimum cost difference for resource A and C. Here minimum cost difference for resource A is 5 while for resource C is 6. Since 6 is the maximum difference which represents resource C and hence assign resource C to activity IV. Finally, the remaining resource is A with single activity VI and hence assigned resource A to activity VI and is shown in Table 5.22a. Since it gives unique assignment and hence we achieved our optimal solution, which is shown in Table Table 5.23 Workers Machines A VI 10 B III 2 C IV 6 D V 1 E I 3 F II 4 Total 26 Time (in minute) Result This answer is happened to be same as that of Hungarian method. Hence we can say that the minimum value is still 26 in both the methods. So our method also gives Optimal Solution. However our method seems to be very simple, easy and takes very few steps in solving the problem.
22 Algorithm for Maximization Case Let A, B, C Z denote resources and I, II, III, IV denote the activities. Now we discussed various steps for solving assignment problem which are following. Step 1 Construct the data matrix of the assignment problem. Consider row as a worker (resource) and column as a job (activity). Step 2 Write two columns, where column 1 represents resource and column 2 represents an activity. Under column 1, write the resource, say, A, B, C Z. Next find maximum unit cost for each row, whichever maximum unit cost is available in the respecting column, select it and write it in term of activities under column 2. Continue this process for all the Z rows and write in term of I, II Step 3 Let for each resource; if there is unique activity then assigned that activity for the corresponding resource, hence we achieved our optimal solution. For example, let we have 5 resources A, B, C, D, E and 5 activities I, II, III, IV, V. This is shown in Table Table 5.24 Column 1 Column 2 Resource Activity A V B III C I D IV E II If there is no unique activity for corresponding resources then the assignment can be made using following given steps: Step 4 Look at which of any one resource has unique activity and then assign that activity for the corresponding resource. Next delete that row and its corresponding column for which resource has already been assigned. Step 5 Again find the maximum unit cost for the remaining rows. Check if it satisfy step 4 then perform it. Otherwise, check which rows have only one same activity. Next find difference between maximum and next maximum unit cost for all those rows which have same activity. Assign that activity which has maximum
23 91 difference. Delete those rows and corresponding columns for which those resources have been assigned. Remarks 1 However if there is tie in difference for two and more than two activity then further take the difference between maximum and next to next maximum unit cost. Next check which activity has maximum difference, assign that activity. Step 6 Repeat steps 4 to 5 till all jobs are assigned uniquely to the corresponding activity. Step 7 Once all the jobs are assigned then calculate the total cost by using the expression, Total cost = c ij x ij n n i= 1 j= 1 Example A marketing manager has five salesmen and five sales districts. Considering the capabilities of the salesman and the nature of districts, the marketing manager estimates that sales per month (in hundred rupees) for each district would be as follows: Table 5.25 Districts A B C D E Salesman Find the assignment of salesmen to districts that will result in maximum sales. Solution Consider the effective matrix. Now, we select row (salesman) 1 and select that column (district) for which it has maximum sale value. In this example, for row 1, column C and E have the maximum value. So we write salesman 1 under column I and district C and E under column II. In the similar way, we select
24 92 all the salesmen and find the maximum value for the respective districts, which are shown in Table Table 5.26 Table 5.26a Resource Activity 1 C, E 2 A 3 A 4 C 5 C In this example, there is no unique activity for any resource and hence proceed step 4. The maximum difference between maximum and next maximum profit for salesman 2 and 3 are 12 and 8 respectively (as for this two resources activity is same (A)). Here 12 is maximum so assign salesman 2 to district A. This is shown in Table 5.26a. Delete salesman 2 and district A. For remaining resources, maximum profit of the corresponding activity is shown in table The maximum difference between maximum and next maximum profit for salesman 1 and 3 are 0 and 4 respectively (as for this two resources activity is same (E)). Here 4 is maximum so assign salesman 3 to district E. This is shown in Table 5.27a. A B C D E Table 5.27 Table 5.27a Column 1 Column 2 1 C, E 3 E 4 C 5 C Delete salesman 3 and district E. For remaining resources, maximum profit of the corresponding activity is shown in table The maximum difference between maximum and next maximum profit for salesman 1, 4 and 5 are 4, 3 and 5 respectively (as for this two resources activity is same (C)). Here 5 is maximum so assign salesman 5 to district C. This is shown in Table 5.28a. B C D E
25 93 Table 5.28 Table 5.28a Column 1 Column 2 1 C 4 C 5 C Delete salesman 5 and district C. For remaining resources, maximum profit of the corresponding activity is shown in table The maximum difference between maximum and next maximum profit for salesman 1 and 4 are 10 and 2 respectively (as for this two resources activity is same (B)). Here 10 is maximum so assign salesman 1 to district B. This is shown in Table 5.29a. B C D Table 5.29 Table 5.29a Column 1 Column 2 1 B 4 B At the last the salesman 4 and district D remains and hence we assign salesman 4 to district D. Finally, different salesman have assigned district uniquely, which is shown in Table Table 5.30 Salesman District Sales (in hundred) 1 B 38 2 A 40 3 E 37 4 D 36 5 C 40 Total 191 Result This answer is happened to be same as that of Hungarian method because the maximum sale value is 191 in both the methods. So our method also gives Optimal Solution. However our method seems to be very simple, easy and takes very few steps in solving the problem. B D
26 Unbalanced Assignment Problem The method of assignment discussed above requires that the number of columns and rows in the assignment matrix be equal. However, when the given cost matrix is not a square matrix, the assignment problem is called an unbalanced problem. In such cases a dummy row(s) or column(s) are added in the matrix (with zeros as the cost elements) to make it a square matrix. For example, when the given cost matrix is of order 4 3, a dummy column would be added with zero cost element in that column. After making the given cost matrix a square matrix, the new alternate method will be used to solve the problem. Once the unbalanced assignment problem is converted into balanced assignment problem then we can follow usual algorithm to solve the assignment problem. Remark Dummy row/column will not be considered for selecting minimum value in our method for unbalanced assignment problem. Example A city corporation has decided to carry out road repairs on main four arteries of the city. The government has agreed to make a special grant of Rs 50 lakh towards the cost with a condition that the repairs are done at the lowest cost and quickest time. If the conditions warrant, a supplementary token grant will also be considered favorably. The corporation has floated tenders and five contractors have sent in their bids. In order to expedite work, one road will be awarded to only one contractor. Table 5.31 Cost of repairs (Rs lakh) R 1 R 2 R 3 R 4 C C C C C Find the best way of assigning the repair work to the contractors and the costs. Contractor s
27 95 Solution The given cost matrix is not balanced; hence we add one dummy column (road, R 5 ) with a zero cost in that column. The cost matrix so obtained is given in following Table Table 5.32 Cost of repairs (Rs lakh) Contractors R 1 R 2 R 3 R 4 R 5 C C C C C We apply the new alternate method to solve this problem using algorithm discussed in Table 5.33 Column 1 Column 2 Difference C 1 R 1 5 C 2 R 1 10 C 3 R 1 9 C 4 R 1 2 C 5 R 1 5 Assign contractor C 2 to repair road R 1. Next delete Row C 2 and Column R 1 and apply step 4 to 5 which is shown in Table Table 5.34 Column 1 Column 2 Difference C 1 R 2 1 C 3 R 2, R 4 0 C 4 R 2 6 C 5 R 2 1 Assign contractor C 4 to repair road R 2. Next delete Row C 4 and Column R 2 and apply step 4 to 5 which is shown in Table 5.35.
28 96 Table 5.35 Column 1 Column 2 Difference C 1 R 4 4 C 3 R 4 3 C 5 R 4 5 Assign contractor C 5 to repair road R 4. Next delete Row C 5 and Column R 4 and apply step 4 to 5 which is shown in Table Table 5.36 Column 1 Column 2 Difference C 1 R 3 19 C 3 R 3 21 In this step, only one column (except dummy column) remains along with two rows C 1 and C 3. So assign C 1 to R 3 (as value is minimum). Next only row C 3 remains to assign which will be assign to dummy column R 5. Finally each contractor is assigning to repaired road uniquely which is shown in Table 4.37 along with its corresponding cost. Table 5.37 Column 1 Column 2 Cost C 1 R 3 19 C 2 R 1 7 C 3 R 5 0 C 4 R 2 12 C 5 R 4 16 Total 54 Result This answer is happened to be same as that of Hungarian method because the maximum sale value is 54 in both the methods. So our method also gives Optimal Solution. However our method seems to be very simple, easy and takes very few steps in solving the problem.
29 97 Applications Some of the problems where the assignment technique may be useful are Assignment of workers to machines, salesmen to different sales areas, clerks to various checkout counters, classes to rooms, etc. 5.5 Conclusion Hungarian method is used to obtained optimal solution for an assignment problem. In this chapter, we have developed a new alternate method for solving an assignment problem where it is shown that this method also gives optimal solution. Moreover the optimal solution obtained using this method is same as that of optimal solution obtained by Hungarian method. So we conclude that the Hungarian method and our method give same optimal solution. However the technique for solving an assignment problem using our method is more simple and easy as it takes few steps for the optimal solution.
4 UNIT FOUR: Transportation and Assignment problems
4 UNIT FOUR: Transportation and Assignment problems 4.1 Objectives By the end of this unit you will be able to: formulate special linear programming problems using the transportation model. define a balanced
More informationLinear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.
1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that
More informationSpecial cases in Transportation Problems
Unit 1 Lecture 18 Special cases in Transportation Problems Learning Objectives: Special cases in Transportation Problems Multiple Optimum Solution Unbalanced Transportation Problem Degeneracy in the Transportation
More informationUnit 1. Today I am going to discuss about Transportation problem. First question that comes in our mind is what is a transportation problem?
Unit 1 Lesson 14: Transportation Models Learning Objective : What is a Transportation Problem? How can we convert a transportation problem into a linear programming problem? How to form a Transportation
More informationThe Assignment Problem and the Hungarian Method
The Assignment Problem and the Hungarian Method 1 Example 1: You work as a sales manager for a toy manufacturer, and you currently have three salespeople on the road meeting buyers. Your salespeople are
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationOperation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1
Operation Research Module 1 Unit 1 1.1 Origin of Operations Research 1.2 Concept and Definition of OR 1.3 Characteristics of OR 1.4 Applications of OR 1.5 Phases of OR Unit 2 2.1 Introduction to Linear
More informationKenken For Teachers. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 27, 2010. Abstract
Kenken For Teachers Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 7, 00 Abstract Kenken is a puzzle whose solution requires a combination of logic and simple arithmetic skills.
More informationReview of Fundamental Mathematics
Review of Fundamental Mathematics As explained in the Preface and in Chapter 1 of your textbook, managerial economics applies microeconomic theory to business decision making. The decision-making tools
More informationSensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
More informationLINEAR EQUATIONS IN TWO VARIABLES
66 MATHEMATICS CHAPTER 4 LINEAR EQUATIONS IN TWO VARIABLES The principal use of the Analytic Art is to bring Mathematical Problems to Equations and to exhibit those Equations in the most simple terms that
More informationSolving Linear Programs
Solving Linear Programs 2 In this chapter, we present a systematic procedure for solving linear programs. This procedure, called the simplex method, proceeds by moving from one feasible solution to another,
More informationPlaying with Numbers
PLAYING WITH NUMBERS 249 Playing with Numbers CHAPTER 16 16.1 Introduction You have studied various types of numbers such as natural numbers, whole numbers, integers and rational numbers. You have also
More informationChapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints
Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and
More informationLinear Programming. Solving LP Models Using MS Excel, 18
SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting
More informationMARATHWADA INSTITUTE OF TECHNOLOGY, AURANGABAD
MARATHWADA INSTITUTE OF TECHNOLOGY, AURANGABAD DEPARTMENT OF MASTER OF COMPUTER APPLICATION OPERATION RESEARCH QUESTION BANK SYMCA 2013-14 Part-II OR Assignment Questions Unit-I 1) What is OR techniques?
More information1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationIntroduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
More informationEdExcel Decision Mathematics 1
EdExcel Decision Mathematics 1 Linear Programming Section 1: Formulating and solving graphically Notes and Examples These notes contain subsections on: Formulating LP problems Solving LP problems Minimisation
More informationSimplex method summary
Simplex method summary Problem: optimize a linear objective, subject to linear constraints 1. Step 1: Convert to standard form: variables on right-hand side, positive constant on left slack variables for
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
More informationExponents and Radicals
Exponents and Radicals (a + b) 10 Exponents are a very important part of algebra. An exponent is just a convenient way of writing repeated multiplications of the same number. Radicals involve the use of
More informationLinear Programming Notes VII Sensitivity Analysis
Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization
More information6.4 Normal Distribution
Contents 6.4 Normal Distribution....................... 381 6.4.1 Characteristics of the Normal Distribution....... 381 6.4.2 The Standardized Normal Distribution......... 385 6.4.3 Meaning of Areas under
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More informationThe Graphical Method: An Example
The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationUnit 18 Determinants
Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More informationAlgebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
More informationLecture 1: Systems of Linear Equations
MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationCURVE FITTING LEAST SQUARES APPROXIMATION
CURVE FITTING LEAST SQUARES APPROXIMATION Data analysis and curve fitting: Imagine that we are studying a physical system involving two quantities: x and y Also suppose that we expect a linear relationship
More informationDuality in Linear Programming
Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow
More informationIEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2
IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More informationStandard Form of a Linear Programming Problem
494 CHAPTER 9 LINEAR PROGRAMMING 9. THE SIMPLEX METHOD: MAXIMIZATION For linear programming problems involving two variables, the graphical solution method introduced in Section 9. is convenient. However,
More informationn 2 + 4n + 3. The answer in decimal form (for the Blitz): 0, 75. Solution. (n + 1)(n + 3) = n + 3 2 lim m 2 1
. Calculate the sum of the series Answer: 3 4. n 2 + 4n + 3. The answer in decimal form (for the Blitz):, 75. Solution. n 2 + 4n + 3 = (n + )(n + 3) = (n + 3) (n + ) = 2 (n + )(n + 3) ( 2 n + ) = m ( n
More informationScheduling Algorithm for Delivery and Collection System
Scheduling Algorithm for Delivery and Collection System Kanwal Prakash Singh Data Scientist, DSL, Housing.com Abstract Extreme teams, large-scale agents teams operating in dynamic environments are quite
More information2.5 Zeros of a Polynomial Functions
.5 Zeros of a Polynomial Functions Section.5 Notes Page 1 The first rule we will talk about is Descartes Rule of Signs, which can be used to determine the possible times a graph crosses the x-axis and
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationSpecial Situations in the Simplex Algorithm
Special Situations in the Simplex Algorithm Degeneracy Consider the linear program: Maximize 2x 1 +x 2 Subject to: 4x 1 +3x 2 12 (1) 4x 1 +x 2 8 (2) 4x 1 +2x 2 8 (3) x 1, x 2 0. We will first apply the
More information9.4 THE SIMPLEX METHOD: MINIMIZATION
SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 59 The accounting firm in Exercise raises its charge for an audit to $5 What number of audits and tax returns will bring in a maximum revenue? In the simplex
More informationGraphical Integration Exercises Part Four: Reverse Graphical Integration
D-4603 1 Graphical Integration Exercises Part Four: Reverse Graphical Integration Prepared for the MIT System Dynamics in Education Project Under the Supervision of Dr. Jay W. Forrester by Laughton Stanley
More information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
More informationSYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
More informationThis exposition of linear programming
Linear Programming and the Simplex Method David Gale This exposition of linear programming and the simplex method is intended as a companion piece to the article in this issue on the life and work of George
More informationCOMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012
Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about
More informationChapter 10. Key Ideas Correlation, Correlation Coefficient (r),
Chapter 0 Key Ideas Correlation, Correlation Coefficient (r), Section 0-: Overview We have already explored the basics of describing single variable data sets. However, when two quantitative variables
More information1 Review of Newton Polynomials
cs: introduction to numerical analysis 0/0/0 Lecture 8: Polynomial Interpolation: Using Newton Polynomials and Error Analysis Instructor: Professor Amos Ron Scribes: Giordano Fusco, Mark Cowlishaw, Nathanael
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More informationChapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way
Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)
More informationWorking with whole numbers
1 CHAPTER 1 Working with whole numbers In this chapter you will revise earlier work on: addition and subtraction without a calculator multiplication and division without a calculator using positive and
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationLinear Programming Problems
Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number
More informationChapter 13: Binary and Mixed-Integer Programming
Chapter 3: Binary and Mixed-Integer Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:
More informationThe Basics of FEA Procedure
CHAPTER 2 The Basics of FEA Procedure 2.1 Introduction This chapter discusses the spring element, especially for the purpose of introducing various concepts involved in use of the FEA technique. A spring
More informationOverview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationThe Taxman Game. Robert K. Moniot September 5, 2003
The Taxman Game Robert K. Moniot September 5, 2003 1 Introduction Want to know how to beat the taxman? Legally, that is? Read on, and we will explore this cute little mathematical game. The taxman game
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More informationLinear Programming I
Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins
More informationSession 7 Bivariate Data and Analysis
Session 7 Bivariate Data and Analysis Key Terms for This Session Previously Introduced mean standard deviation New in This Session association bivariate analysis contingency table co-variation least squares
More informationApplied Finite Mathematics Second Edition. Rupinder Sekhon De Anza College Cupertino, California. Page 1
Applied Finite Mathematics Second Edition Rupinder Sekhon De Anza College Cupertino, California Page 1 Author: Rupinder Sekhon Associate Editors: Jessica and Vijay Sekhon Rupinder Sekhon has been teaching
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationBALTIC OLYMPIAD IN INFORMATICS Stockholm, April 18-22, 2009 Page 1 of?? ENG rectangle. Rectangle
Page 1 of?? ENG rectangle Rectangle Spoiler Solution of SQUARE For start, let s solve a similar looking easier task: find the area of the largest square. All we have to do is pick two points A and B and
More information1 Determinants and the Solvability of Linear Systems
1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped
More informationCubes and Cube Roots
CUBES AND CUBE ROOTS 109 Cubes and Cube Roots CHAPTER 7 7.1 Introduction This is a story about one of India s great mathematical geniuses, S. Ramanujan. Once another famous mathematician Prof. G.H. Hardy
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
More informationMatrix Multiplication
Matrix Multiplication CPS343 Parallel and High Performance Computing Spring 2016 CPS343 (Parallel and HPC) Matrix Multiplication Spring 2016 1 / 32 Outline 1 Matrix operations Importance Dense and sparse
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationAssociation Between Variables
Contents 11 Association Between Variables 767 11.1 Introduction............................ 767 11.1.1 Measure of Association................. 768 11.1.2 Chapter Summary.................... 769 11.2 Chi
More informationLeast-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
More information10.1. Solving Quadratic Equations. Investigation: Rocket Science CONDENSED
CONDENSED L E S S O N 10.1 Solving Quadratic Equations In this lesson you will look at quadratic functions that model projectile motion use tables and graphs to approimate solutions to quadratic equations
More informationLinear Programming in Matrix Form
Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationOnline Adwords Allocation
Online Adwords Allocation Shoshana Neuburger May 6, 2009 1 Overview Many search engines auction the advertising space alongside search results. When Google interviewed Amin Saberi in 2004, their advertisement
More information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationInteger Programming Formulation
Integer Programming Formulation 1 Integer Programming Introduction When we introduced linear programs in Chapter 1, we mentioned divisibility as one of the LP assumptions. Divisibility allowed us to consider
More informationCircuits 1 M H Miller
Introduction to Graph Theory Introduction These notes are primarily a digression to provide general background remarks. The subject is an efficient procedure for the determination of voltages and currents
More informationIE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationGENERALIZED INTEGER PROGRAMMING
Professor S. S. CHADHA, PhD University of Wisconsin, Eau Claire, USA E-mail: schadha@uwec.edu Professor Veena CHADHA University of Wisconsin, Eau Claire, USA E-mail: chadhav@uwec.edu GENERALIZED INTEGER
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationOptimization in ICT and Physical Systems
27. OKTOBER 2010 in ICT and Physical Systems @ Aarhus University, Course outline, formal stuff Prerequisite Lectures Homework Textbook, Homepage and CampusNet, http://kurser.iha.dk/ee-ict-master/tiopti/
More informationFactoring Algorithms
Institutionen för Informationsteknologi Lunds Tekniska Högskola Department of Information Technology Lund University Cryptology - Project 1 Factoring Algorithms The purpose of this project is to understand
More information