If the constraints in a linear programming problem are changed
A) the problem is to be re-evaluated
B) solution is not defined
C) the objective function has to be modified
D) the change in constraints is ignored.
Correct Answer:
Verified
Q13: Non-negative condition in an LP model implies
A)a
Q14: The set of decision variable which satisfies
Q15: The intermediate solutions of constraints must be
Q16: A basic solution is called non-degenerate, if
A)all
Q17: The graph of x?2 and y?2 will
Q18: A solution which satisfies non-negative conditions also
Q19: A solution which optimizes the objective function
Q20: In. L.P.P----
A)objective function is linear
B)constraints are linear
C)both
Q22: Linear programming is a
A)constrained optimization technique
B)technique for
Q23: A constraint in an LP model restricts
A)value
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents