Budget constraint: An inequality that limits spending to available funds. The total cost of all items must be less than or equal to the budget.
- Define variables with clear meaning
- Calculate cost of each item type
- Sum costs to get total expenditure
- Set total ≤ available budget
- Add practical restrictions if needed
Let a = number of units of Type A supplies
Let b = number of units of Type B supplies
Cost of Type A: 50a dollars
Cost of Type B: 30b dollars
Total cost: 50a + 30b
Budget: 2000 dollars
Constraint: 50a + 30b ≤ 2000
a ≥ 0 and b ≥ 0 (cannot purchase negative units)
All combinations of supplies that stay within budget
(20, 30): 50(20) + 30(30) = 1000 + 900 = 1900 ≤ 2000 ✓
(40, 0): 50(40) + 30(0) = 2000 ≤ 2000 ✓
The inequality 50a + 30b ≤ 2000 models all possible purchasing combinations within the $2000 budget
• Budget constraint: Total spending ≤ Available funds
• Variable definition: Clear meaning with units
• Practical restrictions: Non-negative constraints for real-world quantities
Time constraint: An inequality that limits the total time available for activities. Combined with minimum requirements, it creates a system of constraints.
Let a = hours worked at Job A
Let b = hours worked at Job B
Total hours: a + b
Maximum allowed: 40 hours
Constraint: a + b ≤ 40
At least 10 hours at Job A
Constraint: a ≥ 10
a ≥ 0 and b ≥ 0 (cannot work negative hours)
All work schedules that satisfy both time limits and minimum requirements
(15, 20): 15 + 20 = 35 ≤ 40 ✓ and 15 ≥ 10 ✓
(25, 15): 25 + 15 = 40 ≤ 40 ✓ and 25 ≥ 10 ✓
The system of inequalities a + b ≤ 40 and a ≥ 10 models all possible work schedules that respect the time limit and minimum requirement
• Time constraints: Total time ≤ Available time
• Minimum requirements: Use ≥ for "at least" conditions
• Multiple constraints: Each limitation creates a separate inequality
Capacity constraint: An inequality that limits production based on available resources such as time, space, or equipment. Multiple resource types create multiple constraints.
Let x = number of units of Product X produced daily
Let y = number of units of Product Y produced daily
Product X uses 3 hours of assembly per unit
Product Y uses 2 hours of assembly per unit
Available assembly time: 60 hours
Constraint: 3x + 2y ≤ 60
Product X uses 1 hour of packaging per unit
Product Y uses 2 hours of packaging per unit
Available packaging time: 40 hours
Constraint: x + 2y ≤ 40
x ≥ 0 and y ≥ 0 (cannot produce negative units)
All production combinations that fit within available time for both processes
(10, 10): Assembly: 3(10) + 2(10) = 50 ≤ 60 ✓, Packaging: 10 + 2(10) = 30 ≤ 40 ✓
(15, 5): Assembly: 3(15) + 2(5) = 55 ≤ 60 ✓, Packaging: 15 + 2(5) = 25 ≤ 40 ✓
The system of inequalities 3x + 2y ≤ 60 and x + 2y ≤ 40 models all possible daily production combinations that fit within assembly and packaging time limits
• Resource allocation: Track resource usage per unit
• Multiple constraints: Each resource creates its own inequality
• Production planning: Solution region shows viable production strategies
Constraint: A mathematical limitation that restricts the possible values of variables in a real-world problem.
Budget constraint: An inequality limiting spending to available funds: ax + by ≤ budget.
Time constraint: An inequality limiting total time used: ax + by ≤ available_time.
Capacity constraint: An inequality limiting production or usage based on available resources.
Minimum requirement: An inequality requiring at least a certain amount: ax + by ≥ minimum.
System of constraints: Multiple inequalities that must all be satisfied simultaneously.
Feasible region: The area where all constraints are satisfied, representing all viable solutions.
- Identify the scenario: Understand the real-world situation and goals
- Define variables: Specify what each variable represents with units
- Identify all constraints: List every limitation and requirement
- Quantify constraints: Convert each to mathematical form
- Write inequalities: Use appropriate symbols (≤, ≥, <, >)
- Add restrictions: Include practical limitations (non-negative, etc.)
- Verify model: Test with realistic examples
Minimum requirement constraint: An inequality of the form ax + by ≥ c, ensuring that certain thresholds are met or exceeded in a real-world scenario.
Let p = number of servings of Food P
Let q = number of servings of Food Q
Food P provides 10g protein per serving
Food Q provides 5g protein per serving
Minimum required: 50g
Constraint: 10p + 5q ≥ 50
Food P provides 3g fiber per serving
Food Q provides 6g fiber per serving
Minimum required: 30g
Constraint: 3p + 6q ≥ 30
p ≥ 0 and q ≥ 0 (cannot eat negative servings)
All meal combinations that meet both nutritional requirements
(4, 2): Protein: 10(4) + 5(2) = 50g ≥ 50 ✓, Fiber: 3(4) + 6(2) = 24g ≥ 30 ✗
(3, 4): Protein: 10(3) + 5(4) = 50g ≥ 50 ✓, Fiber: 3(3) + 6(4) = 33g ≥ 30 ✓
The system of inequalities 10p + 5q ≥ 50 and 3p + 6q ≥ 30 models all possible meal plans that meet both protein and fiber requirements
• Minimum constraints: Use ≥ for "at least" requirements
• Nutritional planning: Track nutrient content per serving
• Multiple requirements: Each nutrient creates its own constraint
Combined constraints: A system that includes both minimum and maximum requirements along with resource limitations, creating a comprehensive model of operational constraints.
Let a = number of Type A trucks (carry 4 tons each)
Let b = number of Type B trucks (carry 7 tons each)
Type A carries 4 tons each
Type B carries 7 tons each
Must transport at least 80 tons
Constraint: 4a + 7b ≥ 80
Each truck needs one driver
Maximum available drivers: 15
Constraint: a + b ≤ 15
Must use at least 3 Type A trucks
Constraint: a ≥ 3
a ≥ 0 and b ≥ 0 (cannot use negative trucks)
All truck combinations that satisfy all three constraints simultaneously
(5, 10): Cargo: 4(5) + 7(10) = 90 ≥ 80 ✓, Drivers: 5 + 10 = 15 ≤ 15 ✓, Min A: 5 ≥ 3 ✓
(3, 12): Cargo: 4(3) + 7(12) = 96 ≥ 80 ✓, Drivers: 3 + 12 = 15 ≤ 15 ✓, Min A: 3 ≥ 3 ✓
The system of inequalities 4a + 7b ≥ 80, a + b ≤ 15, and a ≥ 3 models all possible truck combinations that satisfy the cargo, driver, and minimum truck requirements
• Transportation planning: Balance capacity requirements with resource availability
• Multiple constraints: Each requirement creates a separate inequality
• System modeling: All constraints must be satisfied simultaneously
Constraint: A mathematical limitation that restricts the possible values of variables in a real-world problem, typically expressed as an inequality.
Budget constraint: An inequality of the form ax + by ≤ budget, limiting total expenditure to available funds.
Time constraint: An inequality of the form ax + by ≤ time_available, limiting total time usage.
Capacity constraint: An inequality limiting production or usage based on available resources.
Minimum requirement: An inequality of the form ax + by ≥ minimum, ensuring certain thresholds are met.
System of constraints: Multiple inequalities that must all be satisfied simultaneously to represent a complete real-world scenario.
Feasible region: The area of the coordinate plane where all constraints are satisfied, representing all viable solutions.
Resource allocation: The process of distributing limited resources among competing demands according to constraints.
- Understand the scenario: Read and comprehend the real-world situation
- Define variables: Specify what each variable represents with units
- Identify all constraints: List every limitation, requirement, and restriction
- Quantify constraints: Determine the mathematical relationship for each
- Write inequalities: Convert constraints to mathematical form using appropriate symbols
- Add practical restrictions: Include non-negative constraints and other implicit limits
- Verify the model: Test with realistic examples to ensure accuracy
- Interpret results: Explain what the feasible region represents in context
• Variable definition: Always specify what each variable represents with units
• Constraint identification: Every limitation becomes an inequality
• Inequality direction: Match constraint wording ("at most" → ≤, "at least" → ≥)
• Practical restrictions: Include non-negative constraints when appropriate
• System completeness: All constraints must be modeled for accurate representation