UGC NET CS: Discrete Structures & Optimization - Linear Programming - Simplex Method (18)

@sweetyasaiyed5920 UGC NET Paper 2 Computer Science and Applications Code No.:(87) UGC NET CS Syllabus Link: https://comptechaholic.com/e-learning/ For Lecture pdf of given video e-mail at: [email protected] Subject: PDF UNIT1 TOPIC7C Unit 1: Discrete Structures and Optimization (PART: 7C/7) Optimization: Topics Covered: Simplex Method Index: Eg: Maximise Z = 5x1 + 3x2 using Simplex Method Simplex method steps to solve linear programming problem: 1. Standard Form three requirements 2. Determine Slack Variables 3. Setting up the Tableau 4. Check Optimality 5. Identify Pivot Variable / key element 6. Create the New Tableau 7. Check Optimality 8. Optimal Solution Summary of Simplex method steps Summary of example solution Simplex Method V/S Graphical Solution Eg: Maximise 5x1 + 3x2 using Graphical Solution Timecode: 00:28 Simplex method steps to solve linear programming problem: Step1 - Standard Form three requirements 01:43 Step2 -Determine Slack Variables 03:09 Step3 - Setting up the Tableau 06:10 Step4 - Check Optimality 06:29 Step5 - Identify Pivot Variable / key element 07:59 Step6 - Create the New Tableau 11:38 Step7 - Check Optimality 12:10 Repeat Step5 - Identify Pivot Variable / key element 13:32 Repeat Step6 - Create the New Tableau 16:57 Repeat Step7 - Check Optimality 17:19 Optimal Solution 17:49 Summary of Simplex method steps 21:12 Summary of example solution 29:51 Eg: Maximise 5x1 + 3x2 using Graphical Solution 33:14 Simplex Method V/S Graphical Solution