Linear Programming - Applications

Grade 12 Maths — Linear Programming - Applications: 25 practice questions with instant scoring and explanations.

1. A linear programming problem in transportation is used to:
2. The diet problem in linear programming seeks to:
3. In production optimization, the objective is typically to:
4. A manufacturer has two products with profits $3 and $5. Time constraints are 2 and 3 hours respectively, with 12 total hours available. The objective function is:
5. The constraint '12 workers available with 8 hours each' in a workforce problem is written as:
6. In a blending problem, the objective typically is:
7. A warehouse can hold 500 units. With demand of 100 units for product A and 200 for B, the constraint is:
8. In crop allocation, a farmer has 100 acres for two crops. The constraint is:
9. A company produces chairs (profit $50) and tables (profit $80). With 40 labor hours available (2 for chair, 3 for table), the labor constraint is:
10. If production must satisfy demand, then:
11. In a portfolio optimization problem, the objective is typically to:
12. A retailer stocks items with costs $10 and $15, investing $500 total. If x units of first item and y units of second, the budget constraint is:
13. The assignment problem in LP seeks to:
14. In a work scheduling problem with shift constraints, we typically:
15. A company produces deluxe ($80 profit) and standard ($50 profit) models. Machine hours: deluxe uses 3, standard uses 2. With 120 machine hours available, the constraint is:
16. For this production problem, the objective is:
17. In a resource allocation problem with multiple constraints, the feasible region is:
18. A business problem with setup costs is typically:
19. In a mixing problem requiring exactly x% concentration, the constraint is:
20. Sensitivity analysis in LP determines:
21. The shadow price (dual value) in LP represents:
22. Integer linear programming is needed when:
23. Question?
24. Question?
25. Question?