51,783 views
The Big M method is a method used in solving Simplex Algorithm models. In case of = or small = in the model constraints, the big m method or one of the 2-stage methods must be used to find the artificial initial solution. The big m number in the big M method is considered a very high number in mathematics. Or it is defined as a number that is too large to be reached within the model constraints and coefficients. In this video, how to solve a minimization problem with the big m method is shown step by step. The steps in the video can be followed for the manual solution of the big m method. Click for other videos in operations research: • Click for manual solution of operations research maximization problem: • 5- Simplex solution of maximization problem... Simplex Algorithm Click for the explanation of the subject: • 4- Simplex Algorithm To download the file used in the video: https://drive.google.com/uc?export=do... Table of Contents: 00:00 - Introduction 01:00 - less than or equal to inequality 01:48 - Initial Solution 02:46 - greater than or equal to conditions 03:07 - Big M and Two Phase Methods 03:43 - Big M Method 04:14 - Standardization 07:57 - Artificial Initial Solution 08:25 - Adding artificial variables 15:05 - Artificial Initial Table 19:03 - Row Column operations 23:24 - Optimality Condition 27:23 - Table in the Second Iteration 34:38 - Minimum Ratio Test 35:42 - Table in Second Iteration 44:00 - Second iteration table optimality condition 52:00 - Optimal Table 52:40 - Optimal Solutions