BITSAT 2015 Paper
© examsiri.com
Question : 102 of 150
Marks:
+1,
-0
Minimise Z =
c i j x i j
Subject to
x i j = b j , j = 1 , 2 , ... , n
x i j = b j , i = 1 , 2 , .. , m is a LPP with number of constraints
Subject to
Go to Question: