Question:-
A linear programming problem with mixed constraints (some constraints of £ type ) can be solved by which of the following methods ?
Option (A)
Big-M method
Option (B)
Hungarian method
Option(C)
Branch and bound technique
Option(D)
Least cost method
Correct Option:
(A)
Question Solution:
A linear programming problem with mixed constraints (some constraints of £ type and some of ³ type) can be solved by big M-method which involves
(i) Objective function should be changed to maximization function.
(ii) If the constraint is ³ type, along with a slack variable an artificial variable is also used.
question-answer-faq-8939