a) Operations research practitioners do not i) predict future operations ii) build more than one model collect relevant data iii) iv) recommend decision and accept b) An optimization model i) provides the best decision ii) provides decision within its limited context ii) helps in evaluating various alternatives iv) all of the above c) Which of the following is not the characteristic of linear programming? i) resources must be limited i) only one objective function parameters value remains constant during the planning period iv) the problem must be of minimization type solution to an LP problem d) A feasible i) solution to such LP problem must be degenerate ii) feasible region should have a line segment ) alternative solutions exist 21 Page i) must satisfy all of the problem's constraints simultaneously need not satisfy all of the constraints, only some of them ii) ) must be a comer point of the feasible region iv) must optimize the value of the objective function e) If one of the constraint of an equation in an LP problem has an unbounded solution, then (1) SSOA021 ) unbounded solution iv) none of the above (1) iv) none of the above 1) While solving a LP model graphically, the area bounded by the constraints is called (1) i) feasible region ii) infeasible region (1) TEST 1 i) the solution is optimal ii) the solution is infeasible i) the solution is unbounded iv) all of the above (1) (1) 2022 g) If a negative value appears in the solution values (X) column of the simplex table, then (1)