Lesson 1 of 16 • 22 upvotes • 12:49mins
Simplex method of finding feasible solutions in Linear Programming Problem with example. The First step is to introduce slack variables. Next is to assign values to the slack variables. 3rd to form the initial iteration to find pivot row, pivot column and the pivot element. Any few steps followed to find the optimum solution.
16 lessons • 2h 55m
Linear Programming Problem Using Simplex Method
12:49mins
Linear Programming Problem Using Graphical Method
9:46mins
Transportation Problem by North West Corner Method
9:00mins
Big M Method or M Technique
15:00mins
Transportation Problem by Least Cost Method
9:47mins
QR Factorization
12:54mins
The Runge Kutta Methods
13:47mins
Runge Kutta Methods for Solving Simultaneous Differential Equations
10:12mins
Solving Second Order Differential Equation using Runge Kutta Method
9:06mins
Milne's Predictor - Corrector Method
12:07mins
Vogel's Approximation Method - (VAM) for Transportation Problems
14:21mins
Adams Bashforth Predictor and Corrector Method
8:44mins
Karl Pearson's Correlation Coefficient
8:47mins
Variance(X), Variance(Y), Covariance Between X and Y.
9:46mins
Correlation Coefficient for Uncorrelated Random Variables
10:55mins
Correlation Coefficient of Joint Probability Density Function
8:48mins