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

@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 TOPIC7D Unit 1: Discrete Structures and Optimization (PART: 7D/7) Optimization: Topics Covered: Dual Simplex Method Index: Dual Simplex method steps to solve linear programming problem Step 1: Standard Form Step 2: Determine Slack Variables Step 4: Identify key row, outgoing variable, ratio, key column, Entering variable, Key element Step 5: Create New Tableau Step 6: Check Optimality Step 7: Optimal Solution Eg: Max Z = -3x1 - 2x2 using Dual Simplex Method Timecode: 00:19 Dual Simplex method steps to solve linear programming problem 00:25 Example: Max Z = -3x1 - 2x using Dual Simplex method