today i encountered a problem in which we have three redunant constraints[x>0 ,y> 0 and one more]
but in answer they gave only the last one......so does it mean tht x>0 n y>0 are UNIVERSALLY NON_REDUNANT CONSTRAINTS [well high probability for this being true afterall the branch of LINEAR PROGRAMMING IS FOR POSITIVE VARIABLES ONLY [1]]
P>S> some may say y i m saying x>0 n y>0 redunant?? BECOZ in same problem the constraint was given x>5 n y>4 too [3]
-
UP 0 DOWN 0 0 3
3 Answers
39Well...we usually write x > 0, y > 0 just for the sake of it..lol.
1abey maan le tere papaer mein question ho:::
which of follwoing r redunant in the above LPP:
1.x>0,y>0
2.y>4,x>5
3.one more redunant option
4.blah blah!!!!!!
toh which answer will we mark :P
obviuosly 1 & 3
but answer is ONLY 3 [3][3]
toh wat to conclude???? the NON_NEGATIVITY IS NON_REDUNANT>>>????
39Ohhhh...AISA HAI BABUA...hum toh kuch aur samajhke baithe they! :P
Then of course x > 0, y > 0 is NOT redundant, you're right, linear programming for real life situations involves only non negative variables.