Популярное

Музыка Кино и Анимация Автомобили Животные Спорт Путешествия Игры Юмор

Интересные видео

2025 Сериалы Трейлеры Новости Как сделать Видеоуроки Diy своими руками

Топ запросов

смотреть а4 schoolboy runaway турецкий сериал смотреть мультфильмы эдисон
dTub
Скачать

Lec-9 Big M Method Minimization Problem || In Hindi & Urdu || Operation research

Автор: Hafi Academy

Загружено: 2023-04-09

Просмотров: 3112

Описание:

#BigMMethod
#linearprogrammingproblem
#Hafi_Academy

Assalam O Alikum!
Welcome to this video, i hope this video is helpful for you.

This video covers
(Big M Method Minimization Problem || In Hindi || Solve an LPP Example || Operation research)

The Big M method is a technique used in linear programming to handle linear programming problems with both equality and inequality constraints. It involves introducing a large positive constant (often denoted as "M") into the objective function and converting inequality constraints into equality constraints by introducing slack variables. The artificial objective function is then created by adding M multiplied by the slack variables to the original objective function, with the goal of finding a feasible solution for the original problem. The linear programming problem is then solved using standard optimization algorithms, such as the simplex method.

The Big M method is often used when dealing with constraints that cannot be easily expressed as equalities, or when the constraints have both equality and inequality components. For example, if a constraint in a linear programming problem is in the form "ax + by ≥ c", it can be converted into an equality constraint "ax + by + s = c", where "s" is the slack variable. The slack variable represents the excess or surplus of the constraint, and is constrained to be non-negative (s ≥ 0). By introducing slack variables, the original inequality constraints are converted into equality constraints, which allows for the use of standard linear programming techniques, such as the simplex method.

The artificial objective function in the Big M method is used to encourage the slack variables to be zero in the optimal solution, which means that the original inequality constraints are satisfied as equalities. The artificial variable (often denoted as R) is used to represent the artificial objective function, and its coefficient in the artificial objective function is set to one, while the coefficients of the other variables are set to zero. The goal is to minimize the value of the artificial objective function, while satisfying all the constraints, including the artificial constraints. If the optimal solution for the artificial objective function has a value of zero for the artificial variable (R), then the original problem is feasible and the solution is optimal. If the optimal solution for the artificial objective function has a positive value for the artificial variable (R), then the original problem is infeasible, and no feasible solution exists.

Once the linear programming problem is solved using the Big M method, the artificial variables and the artificial objective function are typically removed from the final solution, and the results are interpreted in terms of the original problem. The optimal solution for the variables represents the values that optimize the objective function, subject to the constraints. The values of the slack variables represent the surplus or excess of the resources or constraints, and can be used to interpret the feasibility of the solution. The choice of the value of M in the Big M method is important and should be carefully considered, as it can affect the stability and efficiency of the optimization algorithm. A suitable value of M depends on the specific problem and should be chosen judiciously.




In Hindi and Urdu
Thanks for watching

Your can also watch following course:
__________________________________________
Operation Research || Linear Programming Model
   • Linear Programming Model || Operation Rese...  
___________________________________________
Database System
   • Database System  
___________________________________________
Data Communication and Networking
   • Data Communication and Networking  
___________________________________________
Programming Fundamental (C++)
   • Programming Fundamental (C++)  
___________________________________________
Statistics
   • Statistics  
___________________________________________
How to install Computer Software
   • How to install Computer Software  

-----------------------------------------------------------------------
Hafi Academy
   / @hafi-academy  

Subscribe the channel

Lec-9 Big M Method Minimization Problem || In Hindi & Urdu || Operation research

Поделиться в:

Доступные форматы для скачивания:

Скачать видео mp4

  • Информация по загрузке:

Скачать аудио mp3

Похожие видео

Two-phase Method (Minimization) || Operation Research in Hindi & Urdu

Two-phase Method (Minimization) || Operation Research in Hindi & Urdu

Lec-29 Assignment Problem Hungarian Method | In Hindi | Operation Research

Lec-29 Assignment Problem Hungarian Method | In Hindi | Operation Research

7th Maths Set Concepts (operations on sets)

7th Maths Set Concepts (operations on sets)

LPP  (BIG M METHOD) Minimization case Operations Research Techniques:- by G N Satish Kumar

LPP (BIG M METHOD) Minimization case Operations Research Techniques:- by G N Satish Kumar

❖ The Big M Method : Maximization with Mixed Constraints ❖

❖ The Big M Method : Maximization with Mixed Constraints ❖

Linear Programming Model || Operation Research In Hindi || Computer Optimisations...

Linear Programming Model || Operation Research In Hindi || Computer Optimisations...

Minimization with Mixed Problem Constraints: The Big M Method

Minimization with Mixed Problem Constraints: The Big M Method

Big M Method Maximization Problem || Simplex Method || Operations Research || LPP

Big M Method Maximization Problem || Simplex Method || Operations Research || LPP

L.p.p lecture - 4,  Artificial variable technique , Big M method for solving L.P.P, how to use bigM

L.p.p lecture - 4, Artificial variable technique , Big M method for solving L.P.P, how to use bigM

U.V Method with Optimal solution || Transportation Problem || MODI Method in Urdu & Hindi

U.V Method with Optimal solution || Transportation Problem || MODI Method in Urdu & Hindi

Solution of LPP by simplex method (Big M Method)

Solution of LPP by simplex method (Big M Method)

LPP using [Big M Method] Simple Formula with Solved Problem || in Operations Research :by kauserwise

LPP using [Big M Method] Simple Formula with Solved Problem || in Operations Research :by kauserwise

Big M Method Problem 1 - Linear Programming Problems (LPP) - Engineering Mathematics - 4

Big M Method Problem 1 - Linear Programming Problems (LPP) - Engineering Mathematics - 4

#34 Simplex Method (Minimization Case: Linear Programming) in Hindi//O.R.

#34 Simplex Method (Minimization Case: Linear Programming) in Hindi//O.R.

Ситуация в Сирии: Курды отступают за Евфрат. Сирийская армия наступает на Эт-Табку.

Ситуация в Сирии: Курды отступают за Евфрат. Сирийская армия наступает на Эт-Табку.

Big m method conditions  || big m method in operation research || big m method minimization problem

Big m method conditions || big m method in operation research || big m method minimization problem

M. Technique Method | Lecture 6 | Operation Research | Urdu/Hindi

M. Technique Method | Lecture 6 | Operation Research | Urdu/Hindi

Lec-17 Dual Simplex Method || Minimization Problem || In Hindi ||  Operation Research || Example

Lec-17 Dual Simplex Method || Minimization Problem || In Hindi || Operation Research || Example

Assignment Problem- drawing minimum nnumber of lines

Assignment Problem- drawing minimum nnumber of lines

Lec-10 Big M Method Maximization Problem || In Hindi   || Solve an LPP Example || Operation research

Lec-10 Big M Method Maximization Problem || In Hindi || Solve an LPP Example || Operation research

© 2025 dtub. Все права защищены.



  • Контакты
  • О нас
  • Политика конфиденциальности



Контакты для правообладателей: infodtube@gmail.com