## Discussion Forum

Que. | The following Linear Programming problem has : Max Z =x1 +x2 Subject to = x1-x2 ≥ 0 3x1 -x2 ≤ -3 and xI , x2 ≥ 0 |

a. | Feasible solution |

b. | No feasible solution |

c. | Unbounded solution |

d. | Single point as solution |

Answer:Unbounded solution |