In this video we are going to solve LPP by Graphical method when Objective function is of MINIMIZATION type and all constraints is of less than or equal to type.
check this link for Graphical method basic concepts
• 01 l Graphical Method in LPP in Hindi l Ba...
Check this link for Graphical method MAXIMIZATION case
• 02 l Graphical method in LPP l Maximizati...
Graphical method in LPP
After formulating the Linear programming Model the next step is to solve the model. There are various mathematical method to solve the LPP.
But when we have only two decision variables then we used Graphical method to solve LP model. The steps are
1. Express each constraint in terms of equation i.e. replaces inequality sign in each constraint by an equality sign.
Assign arbitrary value to the decision variables x1 and x2 to get plotting points.
x1 k1 0
x2 0 k2
(x1, x2) = (k1, 0) and (0,k2)
Plot these point on the graph and join them by straight line.
2. If the inequality constraint corresponding to that line is ‘≤’ then the region below the line lying in the first quadrant is shaded.
Similarly for ‘≥’ the region above the line is shaded.
The common region which satisfies all the constraints is called feasible region or solution space.
3. Determine coordinate of each corner point of the feasible region.
4. Compute and compare the value of the objective function at each corner point.
5. Identify corner point that gives optimal (max. or min.) value of the objective function.
useful Video for BBA, MBA , MCA, B.Com, and other student of different universities.
~-~~-~~~-~~-~
Please watch: "UNBALANCED ASSIGNMENT PROBLEM IN OPERATION RESEARCH | USING HUNGARIAN METHOD | Lecture 03"
• Unbalanced Assignment Problem | Using Hung...
~-~~-~~~-~~-~
Поделиться в:
Доступные форматы для скачивания:
Скачать видео mp4
Информация по загрузке:
Скачать аудио mp3
Похожие видео
array(20) {
["2RLGl2unAOM"]=>
object(stdClass)#5768 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "2RLGl2unAOM"
["related_video_title"]=>
string(89) "04 l Graphical method in LPP l MINIMIZATION with MIXED constraints sign l BeingGourav.Com"
["posted_time"]=>
string(19) "7 лет назад"
["channelName"]=>
NULL
}
["FYqg62rYxhs"]=>
object(stdClass)#5773 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "FYqg62rYxhs"
["related_video_title"]=>
string(89) "Simplex Method Problem 1- Linear Programming Problems (LPP) - Engineering Mathematics - 4"
["posted_time"]=>
string(21) "4 года назад"
["channelName"]=>
NULL
}
["UjA2uZQsAso"]=>
object(stdClass)#5766 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "UjA2uZQsAso"
["related_video_title"]=>
string(85) "02 l Graphical method in LPP l Maximization with three constraints l BeingGourav com"
["posted_time"]=>
string(19) "7 лет назад"
["channelName"]=>
NULL
}
["PLS93_P_aAAK54dQzh4p-2SIRGHFuDZmMI"]=>
object(stdClass)#5772 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(34) "PLS93_P_aAAK54dQzh4p-2SIRGHFuDZmMI"
["related_video_title"]=>
string(19) "Operations Research"
["posted_time"]=>
string(0) ""
["channelName"]=>
NULL
}
["Q2zGcmSd41s"]=>
object(stdClass)#5760 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "Q2zGcmSd41s"
["related_video_title"]=>
string(89) "Linear Programming Basic Concepts and Problem Formulation | LPP MATHEMATICAL FROMULATION"
["posted_time"]=>
string(19) "5 лет назад"
["channelName"]=>
NULL
}
["G_dA732qFGw"]=>
object(stdClass)#5775 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "G_dA732qFGw"
["related_video_title"]=>
string(89) "Смысл интеграла и производной. В помощь студенту"
["posted_time"]=>
string(19) "9 лет назад"
["channelName"]=>
NULL
}
["Y7e7DCsDUMY"]=>
object(stdClass)#5764 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "Y7e7DCsDUMY"
["related_video_title"]=>
string(64) "Linear Programming (Optimization) 2 Examples Minimize & Maximize"
["posted_time"]=>
string(19) "5 лет назад"
["channelName"]=>
NULL
}
["-BH1jPggy0Q"]=>
object(stdClass)#5778 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "-BH1jPggy0Q"
["related_video_title"]=>
string(83) "Linear Programming 1 (Graphical Method) #jonahemmanuel #linearprogrammingsolutions"
["posted_time"]=>
string(21) "2 года назад"
["channelName"]=>
NULL
}
["5xd9pAGnPo8"]=>
object(stdClass)#5754 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "5xd9pAGnPo8"
["related_video_title"]=>
string(94) "05 l Graphical method in LPP l EXCEPTIONAL CASES ( UNBOUNDED AND INFEASIBLE) l BeingGourav.Com"
["posted_time"]=>
string(19) "6 лет назад"
["channelName"]=>
NULL
}
["PL23dd-8zssJAdGmsSofO4UaRyEXZDtm7a"]=>
object(stdClass)#5776 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(34) "PL23dd-8zssJAdGmsSofO4UaRyEXZDtm7a"
["related_video_title"]=>
string(64) "Operation Research In Hindi || Computer Optimisations Techniques"
["posted_time"]=>
string(0) ""
["channelName"]=>
NULL
}
["0TD9EQcheZM"]=>
object(stdClass)#5767 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "0TD9EQcheZM"
["related_video_title"]=>
string(62) "Linear Programming 1: Maximization -Extreme/Corner Points (LP)"
["posted_time"]=>
string(20) "10 лет назад"
["channelName"]=>
NULL
}
["KVmgedCeay8"]=>
object(stdClass)#5771 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "KVmgedCeay8"
["related_video_title"]=>
string(100) "Solved numerical on Linear Programming Problem[LPP]using Graphical Method in Hindi BY JOLLY Coaching"
["posted_time"]=>
string(19) "8 лет назад"
["channelName"]=>
NULL
}
["9YKLXFqCy6E"]=>
object(stdClass)#5761 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "9YKLXFqCy6E"
["related_video_title"]=>
string(99) "Введение в симплекс-метод | Решить LP | Симплекс-таблица"
["posted_time"]=>
string(21) "3 года назад"
["channelName"]=>
NULL
}
["lXK96ctMS6w"]=>
object(stdClass)#5759 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "lXK96ctMS6w"
["related_video_title"]=>
string(166) "РОССИЯ: Квартира в Москве - как она выглядит внутри? Покидаю столицу - путешествие по России"
["posted_time"]=>
string(23) "9 часов назад"
["channelName"]=>
NULL
}
["xd29RjLFoQE"]=>
object(stdClass)#5757 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "xd29RjLFoQE"
["related_video_title"]=>
string(91) "Graphical method with three constraints | Objective Function Line | Solution of LP Problem"
["posted_time"]=>
string(19) "7 лет назад"
["channelName"]=>
NULL
}
["SRF84VQP3LU"]=>
object(stdClass)#5758 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "SRF84VQP3LU"
["related_video_title"]=>
string(99) "Lec-1 Graphical Method | Linear Programming Problem | Unique Optimal Solution | Operations Research"
["posted_time"]=>
string(21) "4 года назад"
["channelName"]=>
NULL
}
["79mWMVMQVP4"]=>
object(stdClass)#5755 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "79mWMVMQVP4"
["related_video_title"]=>
string(186) "Инженерная задача за середину семестра РЕШЕНА! 🛠️ Матрицы, комплексные числа и гиперболические фу..."
["posted_time"]=>
string(25) "2 недели назад"
["channelName"]=>
NULL
}
["glNayMLEcWY"]=>
object(stdClass)#5756 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "glNayMLEcWY"
["related_video_title"]=>
string(72) "01 l Graphical Method in LPP in Hindi l Basic Concepts l BeingGourav.com"
["posted_time"]=>
string(19) "7 лет назад"
["channelName"]=>
NULL
}
["mOsJbsb3zbQ"]=>
object(stdClass)#5744 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "mOsJbsb3zbQ"
["related_video_title"]=>
string(83) "Simplex method | LPP on Simplex method in hindi | optimization technique (easy way)"
["posted_time"]=>
string(19) "5 лет назад"
["channelName"]=>
NULL
}
["8oE1FxH11wI"]=>
object(stdClass)#5745 (5) {
["video_id"]=>
int(9999999)
["related_video_id"]=>
string(11) "8oE1FxH11wI"
["related_video_title"]=>
string(117) "Исследование операций (том 11) – ГРАФИЧЕСКИЙ МЕТОД Шринивасы Рао"
["posted_time"]=>
string(19) "9 лет назад"
["channelName"]=>
NULL
}
}