Saved Bookmarks
| 1. |
A Linear Programming Problem is as follows :Minimise z = 2x + ySubject to the constraints x ≥ 3, x ≤ 9, y ≥ 0 x - y ≥ 0, x + y ≤ 14The feasible region has :(a) 5 corner points including (0,0) and (9,5)(b) 5 corner points including (7,7) and (3,3)(c) 5 corner points including (14,0) and (9,0)(d) 5 corner points including (3,6) and (9,5) |
|
Answer» Option : (b) 5 corner points including (7,7) and (3,3) |
|