Please assist with the attachment constrainto convert it to an equationD. The feasible region for all minimizationproblems is the inward bounded region16. The objective function in the...

Please assist with the attachment

Extracted text: 14. Which of the following is a property of a linear programming problem? A. There are no restrictions in allocating 10. A customer who decides to wait in line at a fast food drive-through would experience which of the following service configurations? Cars McDonald's drive-through resources Cars in area Waiting cars & food B. The objective function and constraints can Pick-up only be expressed in terms of equations Pay C. The optimum solution can only be a maximum D. There must be alternative courses of action to choose from in allocating time and resources A. Single channel, single phase B. Single channel, multi-phase C. Multi-channel, single phase D. Multi-channel, multi-phase 15. Which of the following is TRUE about a minimization linear programming problem? A. Most minimization problems are bounded 11. In a linear programming problem, which of the following statements is TRUE? A. Does not violate any of the constraint B. An feasible solution does not violate any of outwards B. All minimization problems are bounded outwards C. Most minimization problems are bounded the constraint inwards C. A linear programming problem with two variables cannot be graphed D. A slack variable is added to the > constrain to convert it to an equation D. The feasible region for all minimization problems is the inward bounded region 16. The objective function in the linear mathematical model: 12. Which of the following is NOT a step in the graphical method of Linear Programming? A. Draw the constraint boundary line for each A. reflects the terms of the decision making variables B. represent the feasible levels of the activity C. are symbols that restrict decision making D. restrict the decision variables to zero or functional constraint B. Identify the feasible region C. Find the optimal solution using a straight- edge D. Determination of the length of line segments positive values 17. The non-negativity constraints in a linear mathematical model: A. restrict the decision variables to negative 13. What is the objective function of a linear programming problem? A. Linear relationship reflecting the objective values B. violates the constraints of the feasible function solution C. restrict the decision variables to positive B. Represent restrictions on decision making C. Mathematical symbols representing level of activity D. Is a non-negativity constraint that restrict the decision variable to zero values D. does not violate any of the objective constraints