
In this video, you will learn the first step for solving LP problems using simplex method which is to constuct an LP model of the problem.
In this video, you will learn the second step for solving LP problems using simplex method which is to standardize the problem.
In this video, you will learn how to create a simplex table for solving LP problems using simplex method.
In this video, you will learn how to establish a basic initial feasible solution and complete the creation of simplex table.
In this video, you will learn how to perform optimality test for an LP model using the Simplex method.
In this video, you will learn how to iterate towards optimality for an LP model using the Simplex method.
In this video, you will learn how to obtain the optimal solution by repeating steps 5 and 6 using the simplex method.
In this video, you will learn how to solve LP problems for maximization objective using simplex method.
In this video, you will learn how to solve LP problems for maximization objective using simplex method.
In this video, you will learn how to solve Linear Programming problem for maximization objective using simplex method when there is a tie for the key column.
In this video, you will learn how to solve Linear programming problem using simplex method when there are multiple optimal solutions.
In this video, you will learn how to solve linear programming problem using the simplex method with the special case of degeneracy.
In this video, you will learn how to solve linear programming problem using the simplex method with the special case of minimization objective.
In this video, you will learn how to solve linear programming problem using the simplex method with the special case of infeasibility.
In this video, you will learn how to solve linear programming problem using the simplex method with the special case of unrestricted variables.
In this video, you will learn how to solve linear programming problems using the Big M method.
In this video, you will learn how to solve linear programming problems using the big M method. Also, in this example, you will learn how to find out an alternate optimal solution.
In this video, you will learn how to solve linear programming problems using the big M method with minimization objective.
In this video, you will learn how to solve linear programming problems using the big M method with maximization objective and when the constraints have the "greater than", "lesser than" and "equal to" sign.
Rarely the resources to run a company are available in the unlimited quantities. There is always a restriction. Each resource – labour, money, material, equipment is available in its specific quantity which sets a limit on its use. The problem most commonly face by the management is to decide the manner in which these limited resources should be used to achieve the desired objective i.e. profit maximization/cost minimization etc. Here linear programming technique proves to be of great help to the management in the decision-making process. It is a mathematical technique for allotting limited resources of a firm in an optimal manner. This technique embraces almost every functional area of the business-like production, finance, marketing, distribution etc. in every type of industry.
A few areas of application of linear programming technique are production scheduling, assembly line balancing, make or buy decisions, media selection, profit planning, portfolio selection, manpower scheduling, flight scheduling, environment protection, diet problems etc.
In this course, you will learn the simplex method to solve linear programming problems. The different type of problems includes maximization, minimization, multiple optimal solutions, degeneracy, infeasible solution and unrestricted variables etc. You will also learn how to handle linear programming problems using simplex method when the constraints have ‘greater than equal to’ or simply ‘an equal to’ sign which is also known as Big M method.