SAS #18 Exam PDF

SAS \#18(SET A) 1. What is the objective of linear programming?\ a) Maximize or minimize an objective function\ b) Solve quadratic equations\ c) Increase the number of variables\ d) Eliminate inequalities 2. Which type of constraint ensures that variables remain non-negative?...

SAS \#18(SET A) 1. What is the objective of linear programming?\ a) Maximize or minimize an objective function\ b) Solve quadratic equations\ c) Increase the number of variables\ d) Eliminate inequalities 2. Which type of constraint ensures that variables remain non-negative?\ a) Structural constraint\ b) Equality constraint\ c) Non-negativity constraint\ d) Variable constraint 3. What does a feasible region represent in a linear programming graph?\ a) The region with maximum errors\ b) All possible solutions that satisfy the constraints\ c) The area outside the boundary lines\ d) A region without any intersections 4. How is the intersection of constraints useful in linear programming?\ a) It shows the points that violate the objective function\ b) It determines infeasible solutions\ c) It provides the potential optimal solution points\ d) It simplifies the equations 5. Which method is commonly used to solve linear programming graphically?\ a) Trial-and-error method\ b) Matrix method\ c) Graphical method\ d) Differentiation method 6. What happens to the objective function at the vertices of the feasible region?\ a) It reaches either a maximum or minimum value\ b) It stays constant\ c) It becomes undefined\ d) It changes randomly 7. Which of the following is an example of a maximization problem?\ a) Minimizing the cost of materials\ b) Finding the shortest path in a network\ c) Maximizing the profit of a business\ d) Reducing the time required for a task SAS \#18(SET B) 1. What does the slope of a constraint line represent in linear programming?\ a) The sum of the variables\ b) The relationship between variables in the constraint\ c) The maximum value of the objective function\ d) The size of the feasible region 2. What is an objective function in linear programming?\ a) A constraint that must be satisfied\ b) A function to be optimized (maximized or minimized)\ c) A variable that represents time\ d) A boundary line for feasible solutions 3. What is the significance of corner points in linear programming?\ a) They always provide minimum values\ b) They show all possible errors\ c) They contain the optimal solution\ d) They lie outside the feasible region 4. How do you identify an optimal solution in a graphical linear programming problem?\ a) Evaluate the objective function at the intersection of lines\ b) Use only the midpoint of the feasible region\ c) Select the point farthest from the origin\ d) Identify random points within the feasible region 5. Why is it important to understand constraints in linear programming?\ a) To simplify all variables\ b) To increase the number of solutions\ c) To ensure the solution meets all requirements\ d) To maximize the size of the graph 6. If a constraint is 2x+3y≤18, what is the feasible region?\ a) The area above the line\ b) The area below the line\ c) Only the line itself\ d) The intersection of the line and x-axis 7. **Which of the following is an implicit constraint?**\ a) x+y ≤3 0\ b) x ≥ 0\ c) y = 2x+3\ d) x^2^+y^2^=10