# How to Solve a Linear Programming Problem Using the Dual Simplex Method

Hello everyone this is Mirzaei from Cal poly

Pomona, and in this lesson we are going to learn, how to solve a linear programming problem

using the Dual Simplex method. Consider a linear programming problem as shown on the

screen. Suppose we are trying to solve this problem. We have the option of choosing two-phase

or big M to solve this problem. Another alternative to solve this problem would be using the Dual

Simplex method. In Dual Simplex method, we are trying to solve the dual of a problem

instead of the initial problem. Because, according to a theorem, we know that the value of a

primal problem and its dual programming its going to be the same at the optimal point,

and that’s why instead of solving the problem we have the option of solve it dual problem,

because both at the end converge to the same optimal solution. So, let’s look at the dual

programming of this primal problem. Before writing the dual programming of this initial

problem, we need to normalize this problem. We know that for a minimization problem the

normal condition is when all the constraints have>=. Therefore, to change this minimization

problem to a normal form I have to multiply the first three constraints by -1. If I multiply

the first three constraints by -1, and keep the last constraint as it is, I am able to

write the normalized form of this minimization problem. Now, that I have a normal minimization

problem, I am able to write the dual programming of this problem, which is a normal maximization

problem. I can start solving this problem using the Simplex method. Because all the

constraints are in form of=or=sign. So, these are the two important criteria

that we have to have for a problem before start solving it using the Dual Simplex method.

In this problem, since we have all the coefficients of the objective function positive for a minimization,

our objective function is in form of optimality. Also, we have one constraint that has a>=sign

here, and, therefore, both conditions are met to solve this problem using the Dual Simplex

method. The first thing that we need to do before starting the Dual Simplex method is

to standardize this problem. The first three constrains of this problem can be easily standardized

by adding slack variables. Because all the constraints are in form of

a more in depth explanation not too bad

Really helpful. Keep up the good work. Thanks 🙂

tnx 😉 really usefull

Thanks a lot

you are awesome! you tutorials helped me raise my grades 50% more

thanks a lot nice explanation

Make sure you watch 2:42 to 3:08.

Hey, thanks for this lecture. But I was wondering, at 7:05 you say we divide non-zero values of row of Z by negetive values of the pivot row. What if the pivot row had -1, and 2 instead? Because at 7:30 you say we don't consider the signs for minimum test, so we only focused on size of absolute value of Z divided by pivot row?

In short, if pivot row was -1 and +2, we'd get the same answer because the signs don't matter when doing the minimum test?

Best,

Shawn

Gooood thanks 😘

Thank you very much! I have one question. If we had positive values at the rhs of the last step and some values at the row of z that are positive for this min problem, then, do we continue the steps of the simplex method to reach for only negative values at the row of z?i mean, do we continue with the regular simplex?

thank you Shokoufeh Mirzaei

why didn't you just multiply your 4th constraint by -1 to make things easier?

good job , Thank you

How to choose the pivotal element, if minimum test gives to equal values?

In maximization problem we won't get any -ve value in row of Z, then how to perform minimum test?

Hello. At 1:36 when you write down the next part of the equation. Why do you write >= 3 and >=4 ? Where did you get those numbers?

Please show change of unrestricted variable if ith constant is in equal sing"=" then its ith dual variable must be stated as unrestricted. Can you briefly explain it?

thnks a lot uable me to pass pass my b.tech math exam

How are you ..lde problem on the subject of linear programming .. when a professor at the University gives to the student in question and there are question directly equations and the objective function etc will be resolved directly by the graph … I have a problem when the teacher gives us a question, and this question be a way of words and the student who is extracted from the two variables here lies the difficulty I hope you to help us in some way in order to know how to extract the two variables of the question (x1 and x2) .. what is the way of thinking or to extract variables from so questions (thank you)

VOUS ETES SPECTACULAIRE…. BRAVO..i barely can understand english and i understood this lesson 😀 thanks .

really helpful thank you !

Finally, someone explained the relation Primal-Dual and Dual Simplex, ive been reading Taha's book, but is unclear. Thank You! (btw: you're cute, i added you in instagram lol)

Thank you for the video, much appreciated.

If I continue with your solution using primary simplex method I get Z*=900 and X2 = 225 , because in Z line is -1 which can be improved by primary simplex (every variable in z must be >=0). It pass through all constraints. So what is the right solution?

What should I do, when instead of x1+2×2>=150 I have x1+2×2=150. Should I replace constraint containing = with 2 constraints containing >= and <=? If yes, how exactly?

thanks.

Thank you so much. Compliments from Portugal!

If I could upvote this video a thousand times I would.

Thank you ma'm. You nailed it in just 10 minutes. Helped me a lot for my exam

Your videos helped me a lot. I appreciate it!

THANKS YOU A LOT!! please upload more videos!! you're great

thank you very much!

thank you very much. you helped me a lot

Great explanation, I definitely appreciate the work you put into this! Linear Programming is hands down the easiest math explained in the most complicated way lol.

nice video

Thanx a lot 🙂

thanks Shokoufeh

What does the W at 1 minute 50 second stands for? Please respond soon.

You are the best teacher ever!

I was deeply confused until I realized you just threw everything you explained away 3 minutes in.

How to solve if we have an equality constraint???

Thank you! Your explanations are very clear.

Thank you, helped me so much !

hi after converting the problem to maximization why didn't you solve it using simplex method

How are you ? In simplex method how do you go about a problem when a variable enters the basis in one table then leaves the basis after in the next problem.

Good content. .. but for the love of he god please speak louder .. no hurry just take a breath and speak loudly. ..otherwise sleepy

This video is MVP

hope i pass tommorow.

Thank you very much for this example. It was very clear 🙂

Hi there!

First of all, thank you ever so much for your clear explanations, they really help!

I'm confused however; in another video ( https://www.youtube.com/watch?v=BctoW-x8cPI ) the method is applied to a maximisation problem with an objective function with all POSITIVE coefficients…and this contravenes the criteria pointed out in this video. Could you possibly shed some light on what's going on here? 🙂 Is the other video simply wrong or is there something I haven't understood correctly? 😀

Thank you so much !!

Could you explain how the dual problem is solved using matrices. I didn't quite understand the notation such as z=Cx

Thanks! your explanation is very easy to understand!

The amount of times I have rather watched this video than work through all the theory is uncountable – thank you for the great video 🙂

The best video out there for understanding Dual Simplex Method… Great work

Great explanation! Thank you!

What changes do we make for maximization problem?

Thank you very much, I have a question.

What would we do if in the new table there was no negative RHS but there is a one positive coefficient in the row of Z?

ur voice is soo sweet i think i can never forget this dual simplex

Beautiful, smart, and stunning

Explained extremely well, hopefully I do well on my quiz !

Was confused before watching this video as to what the heck has dual of an LPP got to do with the Dual Simplex method…This video made it clear the start itself..Too good 🙂

عاشقتم با این توضیح دادنتتتت 😍😍😍😍

Flawless explanation. I appreciated the prelusion you made by first explaining the usefulness of this method before getting through the different steps of this lesson

It was easy to Understand Mam

What if we had only one inequality in the prime? the dual objective function would fall short of y2, y3, and y4.. I faced such a thing while trying to apply it on a simple

Set Coverproblem.this was very helpful 😉 thanks!!

5:05' when you standard the problem, why did you kept the min on the objectif function?

isn't min(Z)=-max(-Z)?

Very clear. Thanks.

I have learnt a lot from this video….Many thanks!

Thank you 🙂 Needed this for my exam

👌👌👌👍👍👍👏👏

thank you so much your videos helped me a lot 🙂

if i get a negative rhs for z what should i do ?

thanks a lot !!!

OMG!! You're the best.. Thanks a ton