System of inequalities: A set of mathematical conditions that define constraints in real-world problems. Each inequality represents a limitation on resources or requirements.
- Identify variables and what they represent
- Translate constraints into mathematical inequalities
- Graph each inequality on coordinate plane
- Find intersection of all constraints (feasible region)
- Interpret the solution in context
Let x = number of units of Product A produced daily
Let y = number of units of Product B produced daily
Labor constraint: 2x + y ≤ 100 (hours)
Material constraint: 3x + 5y ≤ 150 (dollars)
Minimum production: x ≥ 10, y ≥ 5
Non-negativity: x ≥ 0, y ≥ 0
2x + y ≤ 100
3x + 5y ≤ 150
x ≥ 10
y ≥ 5
x ≥ 0
y ≥ 0
The feasible region is bounded by the intersection of all constraints. Any point (x,y) within this region represents a valid production plan that satisfies all constraints.
• Constraint modeling: Convert verbal descriptions into mathematical inequalities
• Graphing inequalities: Shade regions that satisfy each inequality
• Feasible region: Intersection of all constraint regions
• Optimization: Solutions lie at vertices of feasible region
Transportation constraints: Mathematical relationships that limit capacity, weight, volume, or other physical limitations in logistics problems.
Let s = number of small packages
Let l = number of large packages
Weight constraint: 20s + 50l ≤ 2000
Volume constraint: 2s + 8l ≤ 200
Minimum delivery: s ≥ 15, l ≥ 10
Check (s,l) = (25,15):
Weight: 20(25) + 50(15) = 500 + 750 = 1250 ≤ 2000 ✓
Volume: 2(25) + 8(15) = 50 + 120 = 170 ≤ 200 ✓
Min requirements: 25 ≥ 15 ✓, 15 ≥ 10 ✓
Yes, delivering 25 small packages and 15 large packages is possible as it satisfies all constraints. The system is: {20s + 50l ≤ 2000, 2s + 8l ≤ 200, s ≥ 15, l ≥ 10}
• Capacity constraints: Total usage cannot exceed maximum capacity
• Substitution test: Plug values into inequalities to verify solutions
• Multiple constraints: All constraints must be satisfied simultaneously
• Feasibility: A solution is valid only if it satisfies ALL constraints
Investment constraints: Mathematical relationships that govern financial allocation problems, including budget limits, risk tolerance, and return requirements.
Let x = dollars invested in Fund X
Let y = dollars invested in Fund Y
Budget: x + y ≤ 10,000
Minimum X: x ≥ 2,000
Minimum Y: y ≥ 1,000
Y vs X: y ≤ 2x
Return: 0.06x + 0.08y ≥ 600
From 0.06x + 0.08y ≥ 600: y ≥ (600 - 0.06x)/0.08
With x ≥ 2,000: y ≥ (600 - 0.06×2000)/0.08 = (600-120)/0.08 = 6,000
Combined with y ≥ 1,000: minimum y = 6,000
Check x = 2,000, y = 6,000:
Budget: 2,000 + 6,000 = 8,000 ≤ 10,000 ✓
Y vs X: 6,000 ≤ 2×2,000 = 4,000 ✗
So y = 6,000 violates y ≤ 2x constraint
The system of inequalities is: {x + y ≤ 10,000, x ≥ 2,000, y ≥ 1,000, y ≤ 2x, 0.06x + 0.08y ≥ 600}. The minimum investment in Fund Y is $4,000 when investing $2,000 in Fund X.
• Multiple constraint interaction: All constraints must be considered together
• Binding constraints: The most restrictive constraint determines the solution
• Return calculations: Amount × rate = return
• Linear optimization: Optimal solutions occur at vertices of feasible region
Linear inequality: Mathematical statement comparing a linear expression to a constant using inequality symbols
Feasible region: Area containing all points that satisfy all constraints simultaneously
Vertex: Corner point of the feasible region where optimal solutions often occur
- Define variables: Identify what quantities need to be determined
- Identify constraints: List all limitations and requirements
- Write inequalities: Convert verbal constraints to mathematical form
- Graph constraints: Plot each inequality on coordinate plane
- Find feasible region: Identify intersection of all constraints
- Interpret solution: Relate mathematical solution to real-world context
• Standard form: ax + by ≤ c or ax + by ≥ c
• Feasible region: intersection of all constraint regions
• Boundary line: ax + by = c (solid for ≤ or ≥, dashed for < or >)
• Vertex testing: optimal solutions occur at corner points
• Non-negativity: x ≥ 0, y ≥ 0 (for real-world problems)
Linear programming: Mathematical method for optimizing a linear objective function subject to linear constraints
Objective function: The quantity to be maximized or minimized
Constraints: Mathematical restrictions on the variables
Optimal solution: The best solution within the feasible region
- Problem identification: Recognize the optimization goal and constraints
- Variable definition: Assign variables to unknown quantities
- Constraint formulation: Write inequalities based on given conditions
- Graphical representation: Plot all constraints to visualize feasible region
- Optimal solution: Find vertex that optimizes the objective function
- Context interpretation: Translate mathematical solution back to real-world meaning
• Linearity: Both constraints and objective functions must be linear
• Convexity: The feasible region is always convex
• Optimality: If optimal solution exists, it occurs at a vertex
• Duality: Every primal problem has a dual optimization problem
• Feasibility: A solution exists only if the feasible region is non-empty