@sweetyasaiyed5920
#ugcnetpaper2
#computerscience
Code No.:(87)
#ugcnetsyllabus2024
https://comptechaholic.com/e-learning/
Related Lecture Link:
Lecture-16 Linear Programming: https://youtu.be/bzMnXyf0d4o
Lecture-16 Mathematical Model: https://youtu.be/bzMnXyf0d4o
Lecture-17 Graphical Solution: https://youtu.be/_XrsksRRS7U
Lecture-18 Simplex Method: https://youtu.be/ArvGGQqKLF8
Lecture-19 Dual Simplex Method: https://youtu.be/glBHpH9LoK0
Lecture-20 Sensitive Analysis: https://youtu.be/cPbgppXfTqQ
Lecture-21 Big M Method: https://youtu.be/YG9moeTgh1s
Lecture-22 IPP - Gomory’s Cutting Plane Method: https://youtu.be/pckPrrTqJbw
For Lecture pdf of given video e-mail at:
[email protected]
Subject: PDF UNIT1 TOPIC7H
Unit 1: Discrete Structures and Optimization (PART: 7H/7)
#Optimization:
Topics Covered:
Integer Programming: Branch and Bound Method
Index:
Branch & Bound Method:
Find optimal solution of given IPP using Branch & Bound Method
Max Z=x1+4x2
Subject to constraints:
2x1 + 4x2 ≤ 7
5x1 + 3x2 ≤ 15
x1,x2 ≥ 0 and are integer.
Time code:
00:43 Find optimal solution of given IPP using Branch & Bound Method
00:55 Solving original LPP using Simplex method
10:31 Solving Sub-Problem-1 using Simplex Method
19:07 Solving Sub-Problem-2 using Simplex Method followed by Dual Simplex Method
25:42 Solving Sub-Problem-3 using Simplex Method
28:21 Solving Sub-Problem-4 using Graphical Method
33:36 Solving Sub-Problem-5 using Big M Method
41:25 Solving Sub-Problem-6
