You can get max or min also Example 1 Max z=x1+2x2 s.t. 2x1+3x2=4, x1,x2>=0 In both examples , feasible region is unbounded and you will get optimal solution.
Hi sir.... But if it is not bounded how to get maximum value sir.... We have to get same answer in any method.... Is this right sir.. If we don't get optimal solution in method and if we get optimal solution in another..... How it is correct?
Hi sir.... But if it is not bounded how to get maximum value sir.... We have to get same answer in any method.... Is this right sir.. If we don't get optimal solution in method and if we get optimal solution in another..... How it is correct?
That's true ... We will get same answer by all methods... Here, we discuss, feasible region is unbounded but solution is optimal... Many example exist such as Min Z = x1+2x2 S.t. 2x1+3x2>=4 X1,x2>=0 Then see feasible region is unbounded and you are able to find minimum value still, but not find maximum ....
@@user-nhjxoui9 please see the 2nd lecture as mention by @ Dr. Harish Garg Sir. Even, look at objective function with -ve sign in x2 variable..So if you put a big large value of x2 then the objective function will be more less which is not required as maximum, therefore the objective function has a maximum at (4,6)
![[#1] LPP - Graphical method [ Maximization with 2 constraints ] solved problem :-by kauserwise](http://i.ytimg.com/vi/8IRrgDoV8Eo/mqdefault.jpg)
Thanks for such awesome playlist
Thanks.
You can watch from Lecture 1 , you will get a complete understanding of OT course
Sir another doubt...
If in question paper asked, Is unbounded feasible region have optimal solution or not?
What is our answer?
Its unbounded feasible region not unbounded feasible solution.
Then answer is yes , ... Examples given in this lecture
You can get max or min also
Example 1
Max z=x1+2x2 s.t. 2x1+3x2=4, x1,x2>=0
In both examples , feasible region is unbounded and you will get optimal solution.
Hi sir....
But if it is not bounded how to get maximum value sir....
We have to get same answer in any method.... Is this right sir..
If we don't get optimal solution in method and if we get optimal solution in another.....
How it is correct?
See the graphical method video, the same is discussed over that part too... Here feasible region is unbounded but solution is bounded.
Hi sir....
But if it is not bounded how to get maximum value sir....
We have to get same answer in any method.... Is this right sir..
If we don't get optimal solution in method and if we get optimal solution in another.....
How it is correct?
That's true ... We will get same answer by all methods...
Here, we discuss, feasible region is unbounded but solution is optimal... Many example exist such as
Min Z = x1+2x2
S.t. 2x1+3x2>=4
X1,x2>=0
Then see feasible region is unbounded and you are able to find minimum value still, but not find maximum ....
Yeah, finding minimum solution is possible...
But what about maximum sir
@@user-nhjxoui9 please see the 2nd lecture as mention by @ Dr. Harish Garg Sir. Even, look at objective function with -ve sign in x2 variable..So if you put a big large value of x2 then the objective function will be more less which is not required as maximum, therefore the objective function has a maximum at (4,6)