Part 1 - Solving a Standard Minimization Problem using the Dual and the Simplex Method

This video is the 1st part of a video that demonstrates how to solve a standard minimization problem using the dual and the simplex method. References to using the TI-84 plus calculator are also given.

[@MrMome1612]

Thanx bro´
Im studying engineering in Denmark and you make this very easy to understand, unlike my professor!

[@_jinlee]

what happens if you only have one constraint? or if its not a 3x3 matrix.

[@valentinkrastev]

Great stuff, very useful!

[@khajariazhussain4973]

your videos are awesome !

[@TasosKatsaros275]

you are the best! Really thank you!

[@MemoNenoBemo]

Can u explain in details how to use the calculator to do the operations, please ?

[@scottrelliott]

@TheAziMax - The dual method is different than what I know as the 2-phase method. What I know as the 2-phase method involves starting with a non-standard LP problem and using phase 1 pivots to move from outside the feasible region to the feasible region. Once in the feasible region you would use phase 2 pivots to find the optimal solution (if it exists).

[@scottrelliott]

@TheAziMax - I already did that. Check out "Part 1 - Nonstandard Minimization Problem with a Surplus Variable".

[@MissJamjoomeh]

When trying to decide a leaving variable.. I know it has to be the smallest absolute value but can that number be zero?

[@Hardkel]

your voice is so good

[@0101Matrix0101]

What if its a maximum problem and we have to solve it using duality? what will the w be? Someone help me please!!!!

[@brownwallet942]

what if the variables are x and y, not x's. what variables should i replace them?

[@66Narendra99]

After constructing the ratios we observe that 29/5 is lesser than 10/1. We choose the least ratio as our pivot entry. :)

[@TheAziMax]

You call this method the dual, and I know him by 2 Phases...Am I right?
Or are two different methods??

[@TheAziMax]

@scottrelliott Hum ok! Thanks for the answer! A good suggestion to you, a video of the 2 phases method!

[@TheicMoggy]

This is so different from what my OR Prof teaches us but thanks though!

[@wojmaskotki8587]

is it the same as the dual simplex algorithm?

[@hyojeongkang256]

We don't have to add artificial variables?

[@Cathode0]

Nice job on this!

[@CheapHatchback]

Thanks for providing an excellent video

[@kaaroClips]

Thanks a ton... .your vids help ALOT !!

[@alexhawdon]

Very nicely done. Thank you

[@66Narendra99]

No it is not. Because we have already performed 1/5R1 -> R1 which made the pivot entry 1.. :)

[@Mgelakuda]

Very clear! Thank you!

[@okan702]

thank you sir

[@2mallikharjuna]

Its not 3R1+R3->R3
Its 3/5R1+R3

[@ndumisolushaba2403]

Mallikharjuna Rao allanki
Nawt bud, he pivoted row 1 with 5x1\5=1