info@avatto.com
+91-9920808017
0. Consider the following linear programming problem : Max. z = 0.50 x2 – 0.10x1 Subject to the constraints 2x1 + 5x2 < 80 x1 + x2 < 20 and x1, x2 > 0 The total maximum profit (z) for the above problem is :
6
8
101
12
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.