A Beginner's Guide to Solve Linear Programming Problems

Name: A Beginner's Guide to Solve Linear Programming Problems
Rating: 4.6 (12 reviews)

Linear Optimization: Solving steps of Graphical method, Simplex method,Duality from Primal LPP and Dual variable LPP

Created byKalaiselvan M

Last updated 7/2021

English

English [Auto],

What you'll learn

Solving Mechanism of Graphical Method, Simplex Method and Dual LPP.
Identify and solve the maximize and minimize type of linear programming problems.
Difference between primal and dual LPP.
Easy understanding of formulas and calculation steps to solve LPP.

Course content

1 section • 5 lectures • 1h 47m total length

GRAPHICAL METHOD- MAXIMIZE TYPE LINEAR PROGRAMMING PROBLEM19:10
learn to maximize a two-variable linear programming problem with the graphical method: plot constraints in the first quadrant, form the feasible region, evaluate corner points, and choose the optimum.
GRAPHICAL METHOD-MINIMIZE TYPE LINEAR PROGRAMMING PROBLEM13:11
Apply the graphical method to a minimize type linear programming problem; plot constraints in the first quadrant, identify the feasible region, evaluate the objective at corner points, and select optimum.
SIMPLEX METHOD SOLVING OF LINEAR PROGRAMMING PROBLEM.29:40
Solve linear programming problems using the simplex method, converting to standard and canonical forms, building the initial simplex table, and performing iterations to reach optimality.
FORM DUAL LPP FROM PRIMAL LPP23:05
Form dual linear programs from primal ones using duality; convert between max and min objectives, adjust constraint directions, handle unrestricted variables, and split equality constraints as needed.
SOLVING DUAL LP PROBLEM-SIMPLEX METHOD22:14
Learn to solve linear programming with the dual simplex method, form the dual from the primal, use canonical form and slack variables, and find x1=0, x2=10/3.

Requirements

The Students should have an Android device or a Computer/Laptop with Internet to view the course
Basic mathematical knowledge is required. You can easily solve the optimization problems.

Description

Linear programming or linear optimization is a process which takes into consideration certain linear relationships to obtain the best possible solution to a mathematical model. It is also denoted as LPP. It is used for obtaining the most optimal solution for a problem with given constraints. In linear programming we formulate our real-life problem into a mathematical model. It involves an objective function, linear inequalities with subject to constraints. Linear programming (LP also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization).

Linear programming can be applied to various fields of study. It is widely used in mathematics and to a lesser extent in business, economics and for some engineering problems. Industries that use linear programming models include transportation, energy, telecommunications and manufacturing. It has proven useful in modeling diverse types of problems in planning, routing, scheduling, assignment and design.

This course is in English and Tamil language and helps in understanding:

Objective function and constraints.
Study of Graphical method to solve LPP.
Step by step solution of maximization and minimization case LPP using Graphical method.
Study of Simplex method to solve LPP.
Step by step solution of maximization case LPP using Simplex method.
Simplex table construction and calculation of new values.
How to get optimum solution from Simplex table.
How to form Duality from Primal LPP.
Step by step solving of Dual variable LPP using Simplex method.

Who this course is for:

ME, M TECH, BE, B TECH, MBA, BBA, MCA, BCA, Commerce and Management Studies students.