A NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM
|
|
- Esmond Ward
- 6 years ago
- Views:
Transcription
1 A NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM *Kore B. G. Departmet Of Statistics, Balwat College, VITA , Dist.: Sagli (M. S.). Idia *Author for Correspodece ABSTRACT I this paper I have proposed a ew approach to solve a ubalaced assigmet problem (UBAP). This approach icludes two parts. First is to obtai a iitial basic feasible solutio (IBFS) ad secod part is to test optimality of a IBFS. I have proposed two ew methods Row Pealty Assigmet Method (RPAM) ad Colum Pealty Assigmet Method (CPAM) to obtai a IBFS of a UBAP. Also I have proposed a ew method No-basic Smallest Effectiveess Method (NBSEM) to test optimality of a IBFS. We ca solve a assigmet problem of maximizatio type usig this ew approach i opposite sese. By this ew approach, we achieve the goal with less umber of computatios ad steps. Further we illustrate the ew approach by suitable examples. Key Words: BAP, UBAP, IBFS, RPAM, C PAM, NBSEM INTRODUCTION The assigmet problem is a special case of the trasportatio problem where the resources are beig allocated to the activities o a oe-to-oe basis. Thus, each resource (e.g. a employee, machie or time slot) is to be assiged uiquely to a particular activity (e.g. a task, site or evet). I assigmet problems, supply i each row represets the availability of a resource such as a ma, machie, vehicle, product, salesma, etc. ad demad i each colum represets differet activities to be performed such as jobs, routes, factories, areas, etc. for each of which oly oe ma or vehicle or product or salesma respectively is required. Etries i the square beig costs, times or distaces. The assigmet method is a special liear programmig techique for solvig problems like choosig the right ma for the right job whe more tha oe choice is possible ad whe each ma ca perform all of the jobs. The ultimate objective is to assig a umber of tasks to a equal umber of facilities at miimum cost (or maximum profit) or some other specific goal. Let there be m resources ad activities. Let c ij be the effectiveess (i terms of cost, profit, time, etc.) of assigig resource i to activity j (i = 1, 2,., m; j = 1, 2,., ). Let x ij = 0, if resource i is ot assiged to activity j ad x ij = 1, if resource i is assiged to activity j. The the objective is to determie x ij s that will optimize the total effectiveess (Z) satisfyig all the resource costraits ad activity costraits. 1. Mathematical Formulatio Let umber of rows = m ad umber of colums =. If m = the a AP is said to be BAP otherwise it is said to be UBAP. A) Case 1: If m < the mathematically the UBAP ca be stated as follows: Miimize m Z C ij X i 1 j 1 ij (1.1) Subject to X 1, i = 1, 2,.., m (availability costraits), (1.2) j 1 ij X ij i 1 = 0 or 1, j = 1, 2,, (requiremet costraits), (1.3) Ad x ij = 0 or 1, for all i ad j. (1.4) 46
2 B) Case 2: If m > the mathematically the UBAP ca be stated as follows: Miimize Subject to m Z C X ij j 1 X ij X ij i 1 i 1 j 1 ij (1.5) 0 or 1, i = 1, 2,, m (availability costraits), (1.6) = 1, j = 1, 2,, (requiremet costraits), (1.7) Ad x ij = 0 or 1, for all i ad j. (1.8) Presetly a AP ca be solved by usig oe of the four methods, (i) Eumeratio method, (ii) Simplex method (iii) Trasportatio method ad (iv) Hugaria method. Amog these four methods Hugaria method ca be used as a efficiet method for fidig a optimal solutio of a AP. But this method also requires more umber of computatios ad steps. For usig Hugaria method to solve UBAP it is require to covert it ito BAP, Hadley (1997), Taha (2008), Kati Swarup et al., (2008),Gupta ad Hira (2010), Sharma (2010). This leads to cosider a assigmet table of higher order tha the iitial assigmet table, to do more umber of computatios, iteratios ad steps to get a optimal solutio. Also, to solve a AP of maximizatio type, it is require to covert it ito miimizatio type. This leads to do more umber of computatios ad steps to get a optimal solutio. Kore (2008) made a attempt to solve ubalaced trasportatio problem without balacig it. As AP is a particular case of TP i this paper, I have proposed a ew approach to solve a UBAP, which overtakes the problem of degeeracy of trasportatio method. Usig our ew approach we get, optimal solutio of a UBAP without balacig it, with less umber of computatios, steps ad cosiderig iitial assigmet table, without chagig its order. We ca illustrate the compariso betwee our ew approach ad Hugaria Method by solvig various types of UBAPs. 2. A) Algorithms of the ew methods to obtai a IBFS 2.1: Row Pealty Assigmet Method (RPAM) Step1: For each row determie row pealty by takig differece betwee smallest ad ext smallest effectiveess. Step2: Observe the maximum row pealty, select smallest effectiveess correspodig to that row, ad ecircle it, cross out correspodig row ad colum. If there is a tie i maximum row pealty the select the largest effectiveess of the smallest effectiveess correspodig to them. If there is a tie i the largest effectiveess of the smallest effectiveess the select that largest effectiveess correspodig to which ext to ext smallest effectiveess i the row is maximum. If there is agai tie the select oe of them radomly, Step3: Repeat step1 ad step2 util oly oe row is remaied ucrossed. Select smallest effectiveess i the last row, ecircle it ad cross out correspodig row ad colum. If there is a tie i smallest effectiveess the select that smallest effectiveess correspodig to which ext smallest effectiveess i the colum is miimum. 2.2: Colum Pealty Assigmet Method (CPAM) Step1: For each colum determie colum pealty by takig differece betwee smallest ad ext smallest effectiveess. Step2: Observe the maximum colum pealty, select smallest effectiveess correspodig to that colum, ecircle it, cross out correspodig row ad colum. If there is a tie i maximum colum pealty the select the largest effectiveess of the smallest effectiveess correspodig to them. If there is a tie i the largest effectiveess of the smallest effectiveess the select that largest effectiveess correspodig to which ext to ext smallest effectiveess i the colum is maximum. If there is agai tie the select oe of them radomly. 47
3 Step3: Repeat step1 ad step2 util oly oe colum is remaied ucrossed. Select smallest effectiveess i the last colum, ecircle it ad cross out correspodig row ad colum. If there is a tie i smallest effectiveess the select that smallest effectiveess correspodig to which ext smallest effectiveess i the row is miimum. B) Algorithm of the Method to obtai a Optimal Solutio 2.3: No-basic Smallest Effectiveess Method (NBSEM) Step1: Select o-basic cell havig smallest effectiveess. Step 2 : a) Form a loop which starts ad eds at selected o-basic cell cosiderig two basic cells ad two o-basic cells such that, the o-basic cells ad basic cells are alterate i the loop, o more tha two cells i the loop are i the same row or colum. b) Make the total of effectiveess i the o-basic cells (T) ad the total of effectiveess i the basic cells (T ). c) If T = T the it idicates that there exists a alterative solutio to the give AP. d) If T < T the it idicates that improvemet i the preset IBFS is possible. If there is a tie i smallest effectiveess i the o-basic cells the select that smallest effectiveess which provides maximum improvemet. Iterchagig o-basic cells ad basic cells i the row. Select agai smallest effectiveess i o-basic cells ad go to step 2. If T > T the go to (e) e) Icrease the umber of basic cells ad o-basic cells oe by oe up to mi (m, ), form all possible loops oe by oe satisfyig the coditios of formig a loop as stated i (a), go to (b). Note: 1) If a UBAP is of maximizatio type the use RPAM to obtai a IBFS of the UBAP of case1 ad CPAM, to obtai a IBFS of the UBAP of case 2, i opposite sese. 2) For usig the NBSEM to test a optimality of IBFS of the UBAP of case 1 or case 2, select o-basic smallest effectiveess correspodig to which row ad colum have a basic cell. 3) For a UBAP of maximizatio type, to test a optimality of a IBFS we ca use the NBSEM i opposite sese. C) Algorithm of the New Approach to solve a UBAP Step 1: Express the give AP i tabular form. Step 2: Check whether the AP is BAP or UBAP. Step 3: If a AP is UBAP of case 1 the obtai a IBFS usig RPAM. If a AP is UBAP of case 2 the obtai a IBFS by usig CPAM. Step 4: Optimize a IBFS of UBAP by usig NBSEM to get a optimal solutio of give UBAP. Step 5: Write optimal solutio ad the optimum value of objective fuctio (Z). 3. Applicatios of the Approach method We illustrate the effectiveess of the ew approach by solvig various types of APs. Example 3.1: Cosider the followig AP of miimizatio type, Sharma (2010): Here, m = 5 ad = 6 i.e. m <, the problem is UBAP of case 1. Usig the RPAM to obtai a IBFS ad testig its optimality by usig the NBSEM we get, 48
4 Table 3.1: IBFS R.P (24) (16) 16) (8) (8) (16) (10) (9) (10) (0) (0) (4) (10) (20) Here, T= 200 ad T = 212 i.e. T < T, improvemet i the preset solutio is possible by itroducig the o-basic smallest effectiveess 56 i the basis. The improved solutio is, Table 3.2: Optimal Solutio Here, Improvemet i the preset solutio is ot possible by itroducig the o-basic smallest effectiveess 48 i the basis. The preset solutio is optimal solutio to the give UBAP. The optimal solutio is assig, 1 5, 2 2, 3 1, 4 6 ad 5 4, job 3 remaied uassiged. The optimum value of Z is, Z mi = = 326. Now, we solve the above UBAP by usig Hugaria method, covertig the give UBAP ito BAP by itroducig dummy row havig zero effectiveess i each cell we get, Table 3.3: BAP Subtractig the smallest effectiveess i each row from each effectiveess of that row ad drawig he miimum umber of vertical ad horizotal lies ecessary to cover all zeros i the reduced matrix obtaied, we get, Table
5 Here, the umber of lies draw the umber of rows or colums, the optimal solutio caot be obtaied. Subtractig the smallest ucovered effectiveess from each ucovered effectiveess ad addig ito the effectiveess which lies at the itersectio of two lies, ad drawig the miimum umber of vertical ad horizotal lies ecessary to cover all zeros i the ew reduced matrix obtaied we get, Table 3.5 Here, the umber of lies draw the umber of rows or colums, the optimal solutio caot be obtaied. Subtractig the smallest ucovered effectiveess from each ucovered effectiveess ad addig ito the effectiveess which lies at the itersectio of two lies, ad drawig the miimum umber of vertical ad horizotal lies ecessary to cover all zeros i the ew reduced matrix obtaied we get, Table 3.6 Here, the umber of lies draw the umber of rows or colums, the optimal solutio caot be obtaied. Subtractig the smallest ucovered effectiveess from each ucovered effectiveess ad addig ito the effectiveess which lies at the itersectio of two lies, ad drawig the miimum umber of vertical ad horizotal lies ecessary to cover all zeros i the ew reduced matrix obtaied we get, Table 3.7 Here, the umber of lies draw the umber of rows or colums, the optimal solutio caot be obtaied. Subtractig the smallest ucovered effectiveess from each ucovered effectiveess ad addig ito the effectiveess which lies at the itersectio of two lies, ad drawig the miimum umber of vertical ad horizotal lies ecessary to cover all zeros i the ew reduced matrix obtaied we get, 50
6 Table 3.8 Here, the umber of lies draw = the umber of rows or colums. The optimal solutio ca be obtaied. Table 3.9: Optimal Solutio Here, the optimal solutio is assig, 1 5, 2 2, 3 1, 4 6 ad 5 4. The optimum value of Z is, Z mi = = 326. Note: For above example we get a optimal solutio by usig our ew approach i 2 steps, ad cosiderig assigmet table of order 5 6 ad 5 5 i each step respectively. By usig Hugaria method we get a optimal solutio i 7 steps, ad cosiderig assigmet table of order 6 6 from first step to last step. Sice steps are more, computatios are more, ad order of assigmet table is higher, the time required to solve the above UBAP by usig Hugaria method is more tha the time required by usig our ew approach. Example 3.2: Cosider the followig AP of maximizatio type, Kati Swarup et al., (2008): Here, m = 6 ad = 4 i.e. m >, the problem is UBAP of case 2.Usig the CPAM i opposite sese to obtai a IBFS ad usig the NBSEM i opposite sese to test its optimality we get, 51
7 Table 3.10: IBFS C. P. (1) (1) (1) (1) (1) (2) (1) (1) (1) Here, T= 19 ad T = 18 i.e. T > T, improvemet i the preset solutio is possible by itroducig the o-basic largest effectiveess 8 i the basis. The improved solutio is, Table Here, T= 15 ad T = 12 i.e. T > T, improvemet i the preset solutio is possible by itroducig the o-basic largest effectiveess 8 i the basis. The improved solutio is, Table Here, improvemet i the preset solutio is ot possible by itroducig the o-basic largest effectiveess 8 i the basis. The preset solutio is a optimal solutio to the give UBAP. The optimal solutio is assig, 2 1, 3 2, 4 4, ad 6 3, job 1ad 5 remaied uassiged. The optimum value of Z is, Z max = = 28. Now, we solve the above UBAP by usig Hugaria method covertig the give UBAP of maximizatio type ito miimizatio type by subtractig all the effectiveess from largest effectiveess we get, 52
8 Table 3.13: Miimizatio Problem Covertig the give UBAP ito BAP by itroducig two dummy colums havig zero effectiveess i each cell we get, Table 3.14: BAP Subtractig the smallest effectiveess i each colum from each effectiveess of that colum ad drawig the miimum umber of vertical ad horizotal lies ecessary to cover all the zeros i the reduced matrix obtaied we get, Table 3.15 Here, the umber of lies draw the umber of row or colums the optimal solutio caot be obtaied. Subtractig the smallest ucovered effectiveess from each ucovered effectiveess ad addig ito the effectiveess which lies at the itersectio of two lies, ad drawig the miimum umber of vertical ad horizotal lies ecessary to cover all zeros i the ew reduced matrix obtaied we get, Table 3.16 Here, the umber of lies draw = the umber of rows or colums. The optimal solutio ca be obtaied. 53
9 Table 3.17: Optimal Solutio The optimal solutio is assig, 2 1, 3 2, 4 4, ad 6 3. The optimum value of Z is, Z max = = 28. Note: For above example we get a optimal solutio by usig our ew approach i 3 steps ad cosiderig assigmet table of order 6 4, 4 4 ad4 4 respectively. By usig Hugaria method we get a optimal solutio i 5 steps ad cosiderig assigmet table of order 6 6 from first step to last step. Sice steps are more, computatios are more ad order of assigmet table is higher the time required to solve the above UBAP by usig Hugaria method is more tha the time required by usig our ew approach. CONCLUSIONS 1) It is ot required to covert UBAP i the form of BAP to get a optimal solutio. 2) If a IBFS of the UBAP of case 1ad case 2is obtaied by usig RPAM ad CPAM respectively, without balacig it ad it is optimized by usig NBSEM method the the least possible optimum value of Z is achieved. 3) Usig our ew approach to solve the UBAP we get, optimal solutio fastly, without chagig the order of assigmet table, with less umber of steps, iteratios ad computatios. ACKNOWLEDGEMENTS I express my deepest sese of gratitude to Dr. L. B. Thakur, Research Guide, (Rtd.) Professor of Statistics, Dr. B. A. M. Uiversity, Auragabad (M.S.), INDIA, for his ivaluable guidace ad cotiuous ecouragemet. I pay my respect ad gratitude to Dr. A. V. Dattareya Rao, Professor, Departmet of Statistics, Nagarjua Uiversity, Nagarjua Nagar (A.P.), INDIA, for his valuable suggestios ad guidace. REFERENCES Gupta PK, ad Hira DS (2010). Operatios Research, S. Chad ad Compay Ltd., New Delhi, Reprit Hadley G (1997). Liear Programmig, Narosa Publishig House, Delhi. Kati Swarup, Gupta PK, Ma Moha (2008). Operatios Research, Fourteeth Editio. Kore BG (2008). A New Approach To Solve Ubalaced Trasportatio Problem, Joural of Idia Academy of Mathematics 30 (1) Sharma JK (2010). Operatios Research Theory ad Applicatios, Macmilla Idia Limited, 54
10 Delhi. Taha HA (2008). Operatios Research A Itroductio, Pretice Hall of Idia Private Limited, New Delhi, Eighth Editio. 55
Optimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem
Optimizatio Methods: Liear Programmig Applicatios Assigmet Problem Itroductio Module 4 Lecture Notes 3 Assigmet Problem I the previous lecture, we discussed about oe of the bech mark problems called trasportatio
More informationLinear Programming and the Simplex Method
Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is
More informationTRANSPORTATION AND ASSIGNMENT PROBLEMS
Trasportatio problem TRANSPORTATION AND ASSIGNMENT PROBLEMS Example P&T Compay produces caed peas. Peas are prepared at three caeries (Belligham, Eugee ad Albert Lea). Shipped by truck to four distributig
More informationROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND
Pacific-Asia Joural of Mathematics, Volume 5, No., Jauary-Jue 20 ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND SHAKEEL JAVAID, Z. H. BAKHSHI & M. M. KHALID ABSTRACT: I this paper, the roll cuttig problem
More informationWeight Moving Average = n
1 Forecastig Simple Movig Average- F = 1 N (D + D 1 + D 2 + D 3 + ) Movig Weight Average- Weight Movig Average = W id i i=1 W i Sigle (Simple) Expoetial Smoothig- F t = F t 1 + α(d t 1 F t 1 ) or F t =
More informationInteger Programming (IP)
Iteger Programmig (IP) The geeral liear mathematical programmig problem where Mied IP Problem - MIP ma c T + h Z T y A + G y + y b R p + vector of positive iteger variables y vector of positive real variables
More informationBest Optimal Stable Matching
Applied Mathematical Scieces, Vol., 0, o. 7, 7-7 Best Optimal Stable Matchig T. Ramachadra Departmet of Mathematics Govermet Arts College(Autoomous) Karur-6900, Tamiladu, Idia yasrams@gmail.com K. Velusamy
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationMarkov Decision Processes
Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes
More informationOptimization Methods MIT 2.098/6.255/ Final exam
Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationRank Modulation with Multiplicity
Rak Modulatio with Multiplicity Axiao (Adrew) Jiag Computer Sciece ad Eg. Dept. Texas A&M Uiversity College Statio, TX 778 ajiag@cse.tamu.edu Abstract Rak modulatio is a scheme that uses the relative order
More informationScheduling under Uncertainty using MILP Sensitivity Analysis
Schedulig uder Ucertaity usig MILP Sesitivity Aalysis M. Ierapetritou ad Zheya Jia Departmet of Chemical & Biochemical Egieerig Rutgers, the State Uiversity of New Jersey Piscataway, NJ Abstract The aim
More informationLinear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d
Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y
More informationA Block Cipher Using Linear Congruences
Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &
More informationsubject to A 1 x + A 2 y b x j 0, j = 1,,n 1 y j = 0 or 1, j = 1,,n 2
Additioal Brach ad Boud Algorithms 0-1 Mixed-Iteger Liear Programmig The brach ad boud algorithm described i the previous sectios ca be used to solve virtually all optimizatio problems cotaiig iteger variables,
More informationA NEW CLASS OF 2-STEP RATIONAL MULTISTEP METHODS
Jural Karya Asli Loreka Ahli Matematik Vol. No. (010) page 6-9. Jural Karya Asli Loreka Ahli Matematik A NEW CLASS OF -STEP RATIONAL MULTISTEP METHODS 1 Nazeeruddi Yaacob Teh Yua Yig Norma Alias 1 Departmet
More informationPOSSIBILISTIC OPTIMIZATION WITH APPLICATION TO PORTFOLIO SELECTION
THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume, Number /, pp 88 9 POSSIBILISTIC OPTIMIZATION WITH APPLICATION TO PORTFOLIO SELECTION Costi-Cipria POPESCU,
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationPARETO-OPTIMAL SOLUTION OF A SCHEDULING PROBLEM ON A SINGLE MACHINE WITH PERIODIC MAINTENANCE AND NON-PRE-EMPTIVE JOBS
Proceedigs of the Iteratioal Coferece o Mechaical Egieerig 2007 (ICME2007) 2-3 December 2007, Dhaka, Bagladesh ICME07-AM-6 PARETO-OPTIMAL SOLUTION OF A SCHEDULING PROBLEM ON A SINGLE MACHINE WITH PERIODIC
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More informationMath 312 Lecture Notes One Dimensional Maps
Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,
More informationInteger Linear Programming
Iteger Liear Programmig Itroductio Iteger L P problem (P) Mi = s. t. a = b i =,, m = i i 0, iteger =,, c Eemple Mi z = 5 s. t. + 0 0, 0, iteger F(P) = feasible domai of P Itroductio Iteger L P problem
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationA New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem
This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410
More informationA class of spectral bounds for Max k-cut
A class of spectral bouds for Max k-cut Miguel F. Ajos, José Neto December 07 Abstract Let G be a udirected ad edge-weighted simple graph. I this paper we itroduce a class of bouds for the maximum k-cut
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationChapter 15 MSM2M2 Introduction To Management Mathematics
Chapter 15 MSM2M2 Itroductio To Maagemet Mathematics (15.1) Combiatorial Methods (15.1.1) Algorithms & Complexity At the heart of ay combiatorial method is a algorithm; a process which is (supposed) to
More informationAssignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.
PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationPolynomial identity testing and global minimum cut
CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem
More information( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.
Joh Riley 8 Jue 03 ANSWERS TO EXERCISES IN APPENDIX B Sectio B VECTORS AND SETS Exercise B-: Covex sets (a) Let 0 x, x X, X, hece 0 x, x X ad 0 x, x X Sice X ad X are covex, x X ad x X The x X X, which
More informationDETERMINATION OF MECHANICAL PROPERTIES OF A NON- UNIFORM BEAM USING THE MEASUREMENT OF THE EXCITED LONGITUDINAL ELASTIC VIBRATIONS.
ICSV4 Cairs Australia 9- July 7 DTRMINATION OF MCHANICAL PROPRTIS OF A NON- UNIFORM BAM USING TH MASURMNT OF TH XCITD LONGITUDINAL LASTIC VIBRATIONS Pavel Aokhi ad Vladimir Gordo Departmet of the mathematics
More informationGroup Assignment Job Constrained Three Dimensional Model
Group Assigmet Job Costraied Three Dimesioal Model Vijayalakshmi R #1, Revathi P #2, Sriivasulu Y #3 Sudara Murthy M #4 #1 Research Scholar, Dept., of Mathematics, Sri Vekateswara Uiversty, Tirupati, Idia
More informationU8L1: Sec Equations of Lines in R 2
MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie
More informationSome New Iterative Methods for Solving Nonlinear Equations
World Applied Scieces Joural 0 (6): 870-874, 01 ISSN 1818-495 IDOSI Publicatios, 01 DOI: 10.589/idosi.wasj.01.0.06.830 Some New Iterative Methods for Solvig Noliear Equatios Muhammad Aslam Noor, Khalida
More informationStat 319 Theory of Statistics (2) Exercises
Kig Saud Uiversity College of Sciece Statistics ad Operatios Research Departmet Stat 39 Theory of Statistics () Exercises Refereces:. Itroductio to Mathematical Statistics, Sixth Editio, by R. Hogg, J.
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationAnalytic Theory of Probabilities
Aalytic Theory of Probabilities PS Laplace Book II Chapter II, 4 pp 94 03 4 A lottery beig composed of umbered tickets of which r exit at each drawig, oe requires the probability that after i drawigs all
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationSupport vector machine revisited
6.867 Machie learig, lecture 8 (Jaakkola) 1 Lecture topics: Support vector machie ad kerels Kerel optimizatio, selectio Support vector machie revisited Our task here is to first tur the support vector
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationThe multi capacitated clustering problem
The multi capacitated clusterig problem Bruo de Aayde Prata 1 Federal Uiversity of Ceará, Brazil Abstract Clusterig problems are combiatorial optimizatio problems wi several idustrial applicatios. The
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 15.053 Optimizatio Methods i Maagemet Sciece (Sprig 2007) Problem Set 3 Due March 1 st, 2007 at 4:30 pm You will eed 116 poits out of 137 to receive a grade of 5.
More informationFastest mixing Markov chain on a path
Fastest mixig Markov chai o a path Stephe Boyd Persi Diacois Ju Su Li Xiao Revised July 2004 Abstract We ider the problem of assigig trasitio probabilities to the edges of a path, so the resultig Markov
More informationEnd-of-Year Contest. ERHS Math Club. May 5, 2009
Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationA proposed discrete distribution for the statistical modeling of
It. Statistical Ist.: Proc. 58th World Statistical Cogress, 0, Dubli (Sessio CPS047) p.5059 A proposed discrete distributio for the statistical modelig of Likert data Kidd, Marti Cetre for Statistical
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationLangford s Problem. Moti Ben-Ari. Department of Science Teaching. Weizmann Institute of Science.
Lagford s Problem Moti Be-Ari Departmet of Sciece Teachig Weizma Istitute of Sciece http://www.weizma.ac.il/sci-tea/beari/ c 017 by Moti Be-Ari. This work is licesed uder the Creative Commos Attributio-ShareAlike
More informationIJSER 1 INTRODUCTION. limitations with a large number of jobs and when the number of machines are more than two.
Iteratioal Joural of Scietific & Egieerig Research, Volume 7, Issue, March-206 5 ISSN 2229-558 Schedulig to Miimize Maespa o Idetical Parallel Machies Yousef Germa*, Ibrahim Badi*, Ahmed Bair*, Ali Shetwa**
More informationMachine Learning Brett Bernstein
Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio
More informationFormulas for the Number of Spanning Trees in a Maximal Planar Map
Applied Mathematical Scieces Vol. 5 011 o. 64 3147-3159 Formulas for the Number of Spaig Trees i a Maximal Plaar Map A. Modabish D. Lotfi ad M. El Marraki Departmet of Computer Scieces Faculty of Scieces
More informationARITHMETIC PROGRESSION
CHAPTER 5 ARITHMETIC PROGRESSION Poits to Remember :. A sequece is a arragemet of umbers or objects i a defiite order.. A sequece a, a, a 3,..., a,... is called a Arithmetic Progressio (A.P) if there exists
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationA collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation
Iteratioal Joural of Mathematics Research. ISSN 0976-5840 Volume 9 Number 1 (017) pp. 45-51 Iteratioal Research Publicatio House http://www.irphouse.com A collocatio method for sigular itegral equatios
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More information1 6 = 1 6 = + Factorials and Euler s Gamma function
Royal Holloway Uiversity of Lodo Departmet of Physics Factorials ad Euler s Gamma fuctio Itroductio The is a self-cotaied part of the course dealig, essetially, with the factorial fuctio ad its geeralizatio
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More informationHow to Maximize a Function without Really Trying
How to Maximize a Fuctio without Really Tryig MARK FLANAGAN School of Electrical, Electroic ad Commuicatios Egieerig Uiversity College Dubli We will prove a famous elemetary iequality called The Rearragemet
More informationScenario Reduction Algorithm and Creation of Multi-Stage Scenario Trees
Fakulteta za Elektrotehiko Heike Brad, Eva Thori, Christoph Weber Sceario Reductio Algorithm ad Creatio of Multi-Stage Sceario Trees OSCOGEN Discussio Paper No. 7 Cotract No. ENK5-CT-2000-00094 Project
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationMATH 10550, EXAM 3 SOLUTIONS
MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationAlgorithm Analysis. Chapter 3
Data Structures Dr Ahmed Rafat Abas Computer Sciece Dept, Faculty of Computer ad Iformatio, Zagazig Uiversity arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ Algorithm Aalysis Chapter 3 3. Itroductio
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationSeed and Sieve of Odd Composite Numbers with Applications in Factorization of Integers
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-75X. Volume 1, Issue 5 Ver. VIII (Sep. - Oct.01), PP 01-07 www.iosrjourals.org Seed ad Sieve of Odd Composite Numbers with Applicatios i
More information[412] A TEST FOR HOMOGENEITY OF THE MARGINAL DISTRIBUTIONS IN A TWO-WAY CLASSIFICATION
[412] A TEST FOR HOMOGENEITY OF THE MARGINAL DISTRIBUTIONS IN A TWO-WAY CLASSIFICATION BY ALAN STUART Divisio of Research Techiques, Lodo School of Ecoomics 1. INTRODUCTION There are several circumstaces
More informationBi-criteria Scheduling on Parallel Machines Under Fuzzy Processing Time
22d Iteratioal Cogress o Modellig ad Simulatio, Hobart, Tasmaia, Australia, 3 to 8 December 207 mssaz.org.au/modsim207 Bi-criteria Schedulig o Parallel Machies Uder Fuzzy Processig Time Sameer Sharma a,
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationLinear Programming! References! Introduction to Algorithms.! Dasgupta, Papadimitriou, Vazirani. Algorithms.! Cormen, Leiserson, Rivest, and Stein.
Liear Programmig! Refereces! Dasgupta, Papadimitriou, Vazirai. Algorithms.! Corme, Leiserso, Rivest, ad Stei. Itroductio to Algorithms.! Slack form! For each costrait i, defie a oegative slack variable
More informationNumerical Solutions of Second Order Boundary Value Problems by Galerkin Residual Method on Using Legendre Polynomials
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-765X. Volume 11, Issue 6 Ver. IV (Nov. - Dec. 15), PP 1-11 www.iosrjourals.org Numerical Solutios of Secod Order Boudary Value Problems
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationSimilarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall
Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig
More informationSolution of Differential Equation from the Transform Technique
Iteratioal Joural of Computatioal Sciece ad Mathematics ISSN 0974-3189 Volume 3, Number 1 (2011), pp 121-125 Iteratioal Research Publicatio House http://wwwirphousecom Solutio of Differetial Equatio from
More informationA Parametric Approach to Solve Bounded-Variable LFP by Converting into LP
Iteratioal Joural of Operatios Research Iteratioal Joural of Operatios Research Vol., No., 0707 (06 A Parametric Approach to Solve ouded-variable LFP by Covertig ito LP Saal Chakroborty ad M. abul Hasa
More informationDifferentiable Convex Functions
Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for
More informationAn Algebraic Elimination Method for the Linear Complementarity Problem
Volume-3, Issue-5, October-2013 ISSN No: 2250-0758 Iteratioal Joural of Egieerig ad Maagemet Research Available at: wwwijemret Page Number: 51-55 A Algebraic Elimiatio Method for the Liear Complemetarity
More informationThe Local Harmonious Chromatic Problem
The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity
More informationAxis Aligned Ellipsoid
Machie Learig for Data Sciece CS 4786) Lecture 6,7 & 8: Ellipsoidal Clusterig, Gaussia Mixture Models ad Geeral Mixture Models The text i black outlies high level ideas. The text i blue provides simple
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More informationProblem Set 4 Due Oct, 12
EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm
More informationComplex Number Theory without Imaginary Number (i)
Ope Access Library Joural Complex Number Theory without Imagiary Number (i Deepak Bhalchadra Gode Directorate of Cesus Operatios, Mumbai, Idia Email: deepakm_4@rediffmail.com Received 6 July 04; revised
More informationSolutions for the Exam 9 January 2012
Mastermath ad LNMB Course: Discrete Optimizatio Solutios for the Exam 9 Jauary 2012 Utrecht Uiversity, Educatorium, 15:15 18:15 The examiatio lasts 3 hours. Gradig will be doe before Jauary 23, 2012. Studets
More informationResolution Proofs of Generalized Pigeonhole Principles
Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity
More informationU8L1: Sec Equations of Lines in R 2
MCVU Thursda Ma, Review of Equatios of a Straight Lie (-D) U8L Sec. 8.9. Equatios of Lies i R Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio
More information