Do it quickly please

QUESTION 1 The type of constraint which specifies maximum capacity of a resource is Non-binding Less than "or equal to constraint Greater than Binding QUESTION 2 Decision variables measure the objective function must exist for each constraint tell how much or how many of something to produce, invest, purchase, hire, etc. represent the values of the constraints QUESTION 3 Operations Research Models in which values of all variables and all possible outcomes are known with certainty are called Symbolie Physical Deterministic Probabilistic models QUESTION 4 solution In graphical linear programming, unbounded solution means O Tafinite feasible Degenerate Unique QUESTIONS If a constraint has a positive slack value in the optimal solution then it will have a positive dual price will have a negative dual price has no restrictions for its dual price. will have a dual price of zero. QUESTION 6 A binding constraint: O has a zero-shadow price the slack value for that constraint is positive. mean that not all the resources for that constraint are used O has a non-zero shadow price QUESTIONS When the dual price is calculated to be 3 for a greater than or equal to constraint in a minimization LP problem, this mear if the comfcient of the objective function is decrease by a then the Roms for that constraint must be increased by 1 the RHS for that constraint is increased by three then the optimal objective function value is increase by 1 dollars 0 0 Ir the RHS for that constraint is increased by one then the optimal objective function value will decrease by 3 dollars if the coemcient of the objective function is increase by 1 then the RHS for that contraint must be increased by QUESTIONS The variable in dual problem which can assume the negative values, positive values or zero values in classified as: Surplus variable Stack variable Decision variable Unrestricted variable