Q1: 1. In linear programming, the objective is to

• A) Maximize profit
• B) Minimize cost
• C) Maximize revenue
• D) Minimize waste

Q2: 2. Which of the following is not a constraint in linear programming?

• A) Budget constraints
• B) Production capacity constraints
• C) Market demand constraints
• D) Employee satisfaction constraints

Q3: 3. A manufacturing company wants to determine the optimal production mix to maximize profit. This is an example of

• A) Linear programming problem
• B) Nonlinear programming problem
• C) Integer programming problem
• D) Dynamic programming problem

Q4: 4. The feasible region in linear programming represents

• A) All points that satisfy the objective function
• B) All points that satisfy the constraints
• C) All points that maximize profit
• D) All points that minimize cost

Q5: 5. Which of the following methods is used to solve linear programming problems graphically?

• A) Simplex method
• B) Gradient descent
• C) Graphical method
• D) Branch and bound

Q6: 6. A transportation company wants to minimize transportation costs while meeting customer demand. This is an example of a

• A) Production planning problem
• B) Inventory management problem
• C) Supply chain optimization problem
• D) Facility location problem

Q7: 7. In linear programming, the decision variables represent

• A) Constraints in the problem
• B) Objective function coefficients
• C) Values to be optimized
• D) Relationships between variables

Q8: 8. Which of the following is a key assumption in linear programming?

• A) Nonlinearity of the objective function
• B) Non-integer solutions
• C) Additivity and proportionality
• D) Unbounded feasible region

Q9: 9. An airline wants to determine the optimal flight schedule to maximize revenue. This is an example of

• A) Project management problem
• B) Scheduling problem
• C) Resource allocation problem
• D) Facility layout problem

Q10: 10. The shadow price in linear programming represents

• A) The change in the objective function value with respect to a unit change in the right-hand side of a constraint
• B) The change in the objective function value with respect to a unit change in a decision variable coefficient
• C) The optimal solution value
• D) The slope of the constraint line

Q11: 11. A manufacturing plant wants to optimize its production process by minimizing energy consumption. This is an example of a

• A) Facility layout problem
• B) Process improvement problem
• C) Quality control problem
• D) Inventory management problem

Q12: 12. Which of the following is not a common application of linear programming in industrial engineering?

• A) Production planning
• B) Inventory management
• C) Facility maintenance
• D) Supply chain optimization

Q13: 13. The corner-point method is used to find the optimal solution in linear programming by

• A) Iteratively moving along the edges of the feasible region
• B) Calculating the gradient of the objective function
• C) Applying the simplex method
• D) Using Lagrange multipliers

Q14: 14. A distribution company wants to determine the optimal warehouse locations to minimize transportation costs. This is an example of a

• A) Facility location problem
• B) Quality control problem
• C) Project management problem
• D) Process improvement problem

Q15: 15. Sensitivity analysis in linear programming helps to

• A) Determine the impact of parameter changes on the optimal solution
• B) Solve nonlinear programming problems
• C) Identify the feasible region
• D) Visualize the objective function

Q16: 16. Which of the following statements is true about the solution to a linear programming problem?

• A) It must lie on the feasible region boundary
• B) It is always an integer value
• C) It is independent of the objective function
• D) It is not affected by changes in constraints

Q17: 17. An agricultural cooperative wants to maximize crop yield while minimizing resource usage. This is an example of an

• A) Inventory management problem
• B) Supply chain optimization problem
• C) Agricultural production problem
• D) Quality control problem

Q18: 18. The dual problem in linear programming is used to

• A) Find the optimal solution to a maximization problem from a minimization problem
• B) Determine the shadow prices of constraints
• C) Solve nonlinear programming problems
• D) Calculate the slope of the objective function

Q19: 19. Which of the following is a limitation of linear programming in industrial engineering applications?

• A) Inability to handle nonlinearity
• B) Dependency on historical data
• C) Lack of sensitivity analysis
• D) Requirement of complex algorithms

Q20: 20. A construction company wants to optimize resource allocation to minimize project completion time. This is an example of a

• A) Facility layout problem
• B) Scheduling problem
• C) Quality control problem
• D) Inventory management problem

Q21: 21. The Big-M method is used in linear programming to

• A) Minimize the objective function
• B) Handle mixed integer programming problems
• C) Solve nonlinear programming problems
• D) Calculate the dual problem

Q22: 22. A retail chain wants to determine the optimal pricing strategy to maximize revenue. This is an example of a

• A) Quality control problem
• B) Supply chain optimization problem
• C) Pricing optimization problem
• D) Inventory management problem

Q23: 23. Which of the following techniques is used to solve linear programming problems with integer constraints?

• A) Simplex method
• B) Branch and bound method
• C) Gradient descent
• D) Lagrange multipliers

Q24: 24. An automotive manufacturer wants to optimize its production line to minimize defects. This is an example of a

• A) Facility layout problem
• B) Quality control problem
• C) Inventory management problem
• D) Scheduling problem

Q25: 25. Linear programming can be applied to optimize

• A) Personal time management
• B) Social media engagement
• C) Transportation routes
• D) Weather forecasting