4 For each case below give an example of a CF LPP with the c

(4) For each case below, give an example of a CF LPP, with the constraint matrix having full rank, that satisfies the condition s IF there is NO (**WAS OMITTED pecified. IN FIRST VERSION***) such example, provide a reason why you think so. Also, interpret each of a,b,c geometrically by drawing an appropriate figure. (a) With 3 decision variables and 2 constraints. Has exactly one basic solution. (b) With 3 decision variables and 2 constraints. Has no basic solutions. (c) With 3 decision variables and 2 constraints. Has no basic feasible solutions. (d) Comes from a standard form LPP with 4 decision variables and 2 constraints, and has 17 basic solutions.

Solution

linear programming is a method to acheive asa maximum oprofit or lowest cost ina amathematical model whose requirements are represented by linear relationships. more formally linear programming isa technique for optimization of a linear objective function