Calculus 1: Applications Word Problems Optimisation Setting Up Objective Constraint Domain Analysis

What Is This?

Optimisation is the process of finding the best solution from all feasible solutions. In exams, it involves setting up an objective function (what you want to maximize or minimize) and constraints (conditions that must be satisfied). Domain analysis helps you understand the feasible region where solutions lie.

This topic appears in exams because it tests your ability to apply mathematical models to real-world problems. Questions typically involve setting up and solving linear programming problems, interpreting constraints, and analyzing feasible regions.

Why It Matters

Optimisation is tested in various exams, including: - Mathematics (high school and university level) - Operations Research
- Economics
- Business and Management

It appears frequently and can carry significant marks (10-20% of the total). It tests your analytical skills, problem-solving abilities, and understanding of mathematical modeling.

Core Concepts

1. Objective Function: The function you want to maximize or minimize. It could be profit, cost, distance, etc.
2. Constraints: Conditions that limit the possible solutions. They can be equalities or inequalities.
3. Feasible Region: The set of all points that satisfy all constraints.
4. Domain Analysis: The process of determining the feasible region by analyzing the constraints.
5. Optimal Solution: The point within the feasible region that gives the best value of the objective function.

Prerequisites

1. Basic Algebra: Understanding of linear equations and inequalities.
2. Graphing: Ability to plot points and lines on a coordinate plane.
3. Problem-Solving Skills: Logical thinking and the ability to translate word problems into mathematical models.

Without these, you'll struggle to set up the objective function and constraints correctly.

The Rule-Book (How It Works)

1. Primary Rule: To solve an optimisation problem, first identify the objective function and constraints.
2. Sub-Rules:
3. Equality Constraints: Must be satisfied exactly.
4. Inequality Constraints: Define a range of possible values.
5. Non-Negativity Constraints: Variables often cannot be negative (e.g., you can't produce negative units of a product).
6. Edge Cases:
7. Degenerate Solutions: When multiple constraints intersect at a single point.
8. Unbounded Solutions: When the feasible region extends infinitely.

Mnemonic: "OF (Objective Function) + C (Constraints) = FR (Feasible Region)"

Exam / Job / Audit Weighting

• Frequency: High
• Difficulty Rating: Intermediate
• Question Type: Multiple-choice, short answer, problem-solving

Difficulty Level

Intermediate

Must-Know Rules, Formulas, Standards, or Principles

1. Objective Function: Define it clearly (e.g., Maximize ( Z = 3x + 4y )).
2. Constraints: Write them accurately (e.g., ( 2x + y \leq 10 )).
3. Feasible Region: Plot the constraints to find the region where all are satisfied.

Worked Examples (Step-by-Step)

Easy

Question: Maximize ( Z = 2x + 3y ) subject to ( x + y \leq 4 ) and ( x, y \geq 0 ).

1. Identify Objective Function: ( Z = 2x + 3y )
2. Identify Constraints: ( x + y \leq 4 ), ( x \geq 0 ), ( y \geq 0 )
3. Plot Constraints: Graph the line ( x + y = 4 )
4. Feasible Region: The region below the line ( x + y = 4 )
5. Optimal Solution: Corner points are (0,0), (4,0), and (0,4). Evaluate ( Z ) at these points.

Answer: Maximum ( Z = 12 ) at (0,4).

Medium

Question: Maximize ( Z = 5x + 7y ) subject to ( 2x + 3y \leq 12 ), ( x + y \leq 5 ), and ( x, y \geq 0 ).

1. Identify Objective Function: ( Z = 5x + 7y )
2. Identify Constraints: ( 2x + 3y \leq 12 ), ( x + y \leq 5 ), ( x \geq 0 ), ( y \geq 0 )
3. Plot Constraints: Graph the lines ( 2x + 3y = 12 ) and ( x + y = 5 )
4. Feasible Region: The region where both inequalities hold
5. Optimal Solution: Corner points are (0,0), (0,4), (3,0), and (1.5,3.5). Evaluate ( Z ) at these points.

Answer: Maximum ( Z = 35 ) at (1.5,3.5).

Hard

Question: Maximize ( Z = 4x + 6y ) subject to ( 3x + 2y \leq 18 ), ( x + 2y \leq 12 ), ( x \geq 0 ), ( y \geq 0 ), and ( y \leq 4 ).

1. Identify Objective Function: ( Z = 4x + 6y )
2. Identify Constraints: ( 3x + 2y \leq 18 ), ( x + 2y \leq 12 ), ( x \geq 0 ), ( y \geq 0 ), ( y \leq 4 )
3. Plot Constraints: Graph the lines ( 3x + 2y = 18 ), ( x + 2y = 12 ), and ( y = 4 )
4. Feasible Region: The region where all inequalities hold
5. Optimal Solution: Corner points are (0,0), (0,4), (6,0), (4,3), and (2,4). Evaluate ( Z ) at these points.

Answer: Maximum ( Z = 36 ) at (4,3).

Common Exam Traps & Mistakes

1. Mistake: Forgetting non-negativity constraints.
2. Wrong Answer: Negative values for ( x ) or ( y ).

3. Correct Approach: Always include ( x \geq 0 ) and ( y \geq 0 ).

4. Mistake: Incorrectly plotting constraints.

5. Wrong Answer: Incorrect feasible region.

6. Correct Approach: Double-check the plotting of each constraint.

7. Mistake: Not evaluating all corner points.

8. Wrong Answer: Missing the optimal solution.

9. Correct Approach: Evaluate the objective function at all corner points.

10. Mistake: Misinterpreting the objective function.

11. Wrong Answer: Incorrect maximization or minimization.
12. Correct Approach: Clearly state whether you are maximizing or minimizing.

Shortcut Strategies & Exam Hacks

1. Memory Aid: Remember "OF + C = FR" for Objective Function, Constraints, and Feasible Region.
2. Elimination Strategy: If a point does not satisfy all constraints, eliminate it.
3. Pattern Recognition: Look for intersections of constraint lines to find corner points quickly.
4. Formula Shortcut: Use the formula for the objective function directly at corner points.

Question-Type Taxonomy

1. Multiple-Choice: Identify the correct objective function or feasible region.
2. Example: Which of the following is the feasible region for the given constraints?

3. Favored By: High school and university math exams.

4. Short Answer: Calculate the optimal value of the objective function.

5. Example: What is the maximum value of ( Z = 3x + 4y ) given the constraints?

6. Favored By: Operations Research and Economics exams.

7. Problem-Solving: Set up and solve a complete optimisation problem.

8. Example: Maximize ( Z = 5x + 7y ) subject to the given constraints.
9. Favored By: Business and Management exams.

Practice Set (MCQs)

Question 1

Question: Maximize ( Z = 2x + 3y ) subject to ( x + y \leq 4 ) and ( x, y \geq 0 ). What is the maximum value of ( Z )? - Options: - A) 8 - B) 10 - C) 12 - D) 14 - Correct Answer: C) 12 - Explanation: The feasible region is below the line ( x + y = 4 ). Corner points are (0,0), (4,0), and (0,4). Evaluating ( Z ) at these points, the maximum is 12 at (0,4).
- Why the Distractors Are Tempting: - A) 8: Incorrect evaluation at (4,0).
- B) 10: Incorrect evaluation at (2,2).
- D) 14: Overestimation, not a feasible point.

Question 2

Question: Which of the following is the feasible region for the constraints ( 2x + 3y \leq 12 ) and ( x + y \leq 5 )? - Options: - A) The region above both lines - B) The region below both lines - C) The region between the lines - D) The region to the left of both lines - Correct Answer: B) The region below both lines - Explanation: Both constraints are inequalities, so the feasible region is below both lines.
- Why the Distractors Are Tempting: - A) The region above both lines: Misinterpretation of inequalities.
- C) The region between the lines: Partial correctness, but not all constraints satisfied.
- D) The region to the left of both lines: Incorrect direction.

Question 3

Question: Maximize ( Z = 4x + 6y ) subject to ( 3x + 2y \leq 18 ), ( x + 2y \leq 12 ), ( x \geq 0 ), ( y \geq 0 ), and ( y \leq 4 ). What is the maximum value of ( Z )? - Options: - A) 30 - B) 32 - C) 34 - D) 36 - Correct Answer: D) 36 - Explanation: The feasible region is defined by the intersections of the constraints. Corner points are (0,0), (0,4), (6,0), (4,3), and (2,4). Evaluating ( Z ) at these points, the maximum is 36 at (4,3).
- Why the Distractors Are Tempting: - A) 30: Incorrect evaluation at (2,4).
- B) 32: Incorrect evaluation at (4,2).
- C) 34: Incorrect evaluation at (3,3).

Question 4

Question: Which of the following is NOT a corner point for the constraints ( 2x + 3y \leq 12 ) and ( x + y \leq 5 )? - Options: - A) (0,0) - B) (0,4) - C) (3,0) - D) (1.5,3.5) - Correct Answer: C) (3,0) - Explanation: The corner points are (0,0), (0,4), and (1.5,3.5). (3,0) does not satisfy ( x + y \leq 5 ).
- Why the Distractors Are Tempting: - A) (0,0): Correct corner point.
- B) (0,4): Correct corner point.
- D) (1.5,3.5): Correct corner point.

Question 5

Question: Maximize ( Z = 5x + 7y ) subject to ( 2x + 3y \leq 12 ), ( x + y \leq 5 ), and ( x, y \geq 0 ). What is the maximum value of ( Z )? - Options: - A) 30 - B) 32 - C) 34 - D) 35 - Correct Answer: D) 35 - Explanation: The feasible region is defined by the intersections of the constraints. Corner points are (0,0), (0,4), (3,0), and (1.5,3.5). Evaluating ( Z ) at these points, the maximum is 35 at (1.5,3.5).
- Why the Distractors Are Tempting: - A) 30: Incorrect evaluation at (3,0).
- B) 32: Incorrect evaluation at (0,4).
- C) 34: Incorrect evaluation at (1.5,3.5).

30-Second Cheat Sheet

• Define the objective function clearly.
• Write all constraints accurately.
• Plot constraints to find the feasible region.
• Evaluate the objective function at all corner points.
• Remember "OF + C = FR" for Objective Function, Constraints, and Feasible Region.

Learning Path

1. Beginner Foundation: Understand basic algebra and graphing.
2. Core Rules: Learn to set up the objective function and constraints.
3. Practice: Solve simple optimisation problems.
4. Timed Drills: Practice under exam conditions.
5. Mock Tests: Take full-length practice exams.

Related Topics

1. Linear Programming: Directly related; optimisation is a key part of linear programming.
2. Graph Theory: Understanding graphs helps in plotting constraints.
3. Calculus: Used for more advanced optimisation techniques.