Linear Programming, Lecture 16. More examples on dual problems. Duality Theorem.

preview_player
Показать описание
Oct 18, 2016. Penn State University.
Рекомендации по теме
Комментарии
Автор

Professor Shen you are awesome. Thanks for being so enthusiastic about the subject and pedagogical!

BHxSnoip
Автор

Thank you so much Dr.Shen for this amazing explanation. My professor at Emory, she used the abstract method of proof that you mentioned. I did feel it sounded like a miracle and couldn't understand it 100%. Your explanation made it much more clear to me and let me realize the amazing beauty laying behind the duality theorem. THANK YOU!!

evanzhao
Автор

I learn a lot from here better than in my class, my professor don't explain things like she did and am so happy to find your videos.

SinghatehAlagie
Автор

These videos are fantastic, explained so many of my previous confusions.

shubozhang
Автор

Really hope that you are my professor, then I won't be worried about the coming exam!

claireliu
Автор

Solve the following integer linear programming problem:
Max 2x1 + 5x2 + 7x3
Subject to
29 4x 3x x 1 + 2 + 3 ≥
where 1 2 x, x and x are non-negative integers. (

myfirstopinion
Автор

In your lecture you have mentioned that in the book there are other examples to practice the table of min/max jump case can you refer us to the book please

Abchs-nimi
Автор

Hi professor, I am wondering if you could give a reference for the abstract method you mentioned in the class? I am interested in seeing why this works. Many thanks in advance.

qleoqux
Автор

This q I'm not getting so what I do

myfirstopinion
Автор

Why did you write min(-z)=
-cx0 not cx0

vanshikathakur
Автор

It is an american uni, why all students I saw are like Chinese lol, why no American students doing applied math ahahaha

tianqilong