Question

A linear programming problem with mixed constraints some constraints of  $\leq$ type and some of $\geq$  can be solved by which of the following methods?               

(a) Big – M method

(b) Hungarian method

(c) Branch and bound technique

(d) Least cost method