Solved Exercises on Modeling Constraints with Inequalities in Algebra 1

Master modeling constraints with inequalities: linear inequalities, word problems, system constraints, and optimization scenarios through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Basic constraint modeling
Exercise 1
A company produces two products A and B. Product A requires 2 hours of labor and 1 hour of machine time. Product B requires 1 hour of labor and 3 hours of machine time. The company has 100 hours of labor and 120 hours of machine time available per day. Write the constraints as inequalities.
Definition:

Modeling constraints: Converting real-world limitations into mathematical inequalities. Constraints represent resource limits, physical restrictions, or business requirements.

Constraint modeling method:
  1. Identify the variables (what quantities are unknown)
  2. Identify the resources or limitations
  3. Express each limitation as an inequality
  4. Include non-negativity constraints
Variables
Let x = units of A, y = units of B
Labor constraint
2x + y ≤ 100
Machine constraint
x + 3y ≤ 120
Step 1: Define variables

Let x = number of units of product A produced daily
Let y = number of units of product B produced daily

Step 2: Identify resource constraints

Labor constraint: Product A uses 2 hours, Product B uses 1 hour
Total labor available: 100 hours
So: 2x + y ≤ 100

Step 3: Identify machine constraint

Machine constraint: Product A uses 1 hour, Product B uses 3 hours
Total machine time available: 120 hours
So: x + 3y ≤ 120

Step 4: Add non-negativity constraints

Cannot produce negative amounts: x ≥ 0 and y ≥ 0

Step 5: Write complete constraint system

2x + y ≤ 100 (labor)
x + 3y ≤ 120 (machine)
x ≥ 0, y ≥ 0 (non-negativity)

Complete constraint system:
2x + y ≤ 100
x + 3y ≤ 120
x ≥ 0, y ≥ 0
Final answer:

The constraints are: 2x + y ≤ 100, x + 3y ≤ 120, x ≥ 0, y ≥ 0

Applied rules:

• Constraint modeling: Express limitations as mathematical inequalities

• Resource allocation: Total usage cannot exceed total availability

• Non-negativity: Physical quantities cannot be negative

2 Budget constraint
Exercise 2
Sarah has $200 to spend on books and pens. Books cost $15 each and pens cost $5 each. She wants to buy at least 5 books and at least 10 pens. Model these constraints as inequalities.
Definition:

Budget constraint: An inequality representing the maximum amount that can be spent given a limited budget. Total spending ≤ Budget.

Variables
Let b = books, p = pens
Budget constraint
15b + 5p ≤ 200
Minimum constraints
b ≥ 5, p ≥ 10
Step 1: Define variables

Let b = number of books purchased
Let p = number of pens purchased

Step 2: Set up budget constraint

Cost of books: 15b dollars
Cost of pens: 5p dollars
Total cost: 15b + 5p dollars
Budget limit: 200 dollars
So: 15b + 5p ≤ 200

Step 3: Add minimum requirements

At least 5 books: b ≥ 5
At least 10 pens: p ≥ 10

Step 4: Include non-negativity

Cannot buy negative items: b ≥ 0, p ≥ 0 (already satisfied by b ≥ 5, p ≥ 10)

Step 5: Simplify budget constraint

Divide by 5: 3b + p ≤ 40

Complete constraint system:
3b + p ≤ 40
b ≥ 5
p ≥ 10
Final answer:

The constraints are: 3b + p ≤ 40, b ≥ 5, p ≥ 10

Applied rules:

• Budget constraint: Total expenditure ≤ Available budget

• Minimum requirements: At least constraints use ≥

• Simplification: Divide by common factors when possible

3 Production constraint
Exercise 3
A factory produces tables and chairs. Each table requires 4 units of wood and 2 hours of finishing. Each chair requires 2 units of wood and 1 hour of finishing. The factory has 80 units of wood and 40 hours of finishing time available. Also, the factory must produce at least 5 tables and at least 10 chairs per day. Model these constraints.
Definition:

Production constraints: Limitations on manufacturing capacity including material availability, labor hours, and demand requirements.

Variables
Let t = tables, c = chairs
Wood constraint
4t + 2c ≤ 80
Finishing constraint
2t + c ≤ 40
Step 1: Define variables

Let t = number of tables produced daily
Let c = number of chairs produced daily

Step 2: Set up wood constraint

Wood for tables: 4t units
Wood for chairs: 2c units
Total wood used: 4t + 2c units
Wood available: 80 units
So: 4t + 2c ≤ 80

Step 3: Set up finishing constraint

Finishing for tables: 2t hours
Finishing for chairs: c hours
Total finishing: 2t + c hours
Finishing available: 40 hours
So: 2t + c ≤ 40

Step 4: Add minimum production requirements

At least 5 tables: t ≥ 5
At least 10 chairs: c ≥ 10

Step 5: Simplify constraints

Wood constraint: 4t + 2c ≤ 80 → divide by 2 → 2t + c ≤ 40

Step 6: Notice redundancy

Both wood and finishing constraints yield 2t + c ≤ 40. This means one resource is the bottleneck.

Complete constraint system:
2t + c ≤ 40
t ≥ 5
c ≥ 10
Final answer:

The constraints are: 2t + c ≤ 40, t ≥ 5, c ≥ 10

Applied rules:

• Resource constraints: Total consumption ≤ Total availability

• Redundancy check: Some constraints may be equivalent

• Production requirements: Minimum production constraints use ≥

Key Concepts, Rules, and Methods
ax + by ≤ c
Linear Inequality Constraint
Constraint Types
≤, ≥, =
Less than, Greater than, Equal to
Standard Form
ax + by ≤ c
Linear inequality in standard form
Non-negativity
x ≥ 0, y ≥ 0
Physical quantities must be non-negative
Key definitions:

Constraint: A mathematical condition that limits the possible values of variables in a problem.

Feasible region: The set of all possible solutions that satisfy all constraints.

Objective function: The quantity to be maximized or minimized in an optimization problem.

Constraint modeling methodology:
  1. Identify decision variables: What quantities are unknown?
  2. Identify constraints: What are the limitations?
  3. Translate to math: Convert each constraint to an inequality
  4. Include non-negativity: Ensure variables are non-negative
  5. Verify completeness: Check all constraints are included
Tip 1: Look for keywords like "at most", "no more than", "cannot exceed" for ≤ constraints.
Tip 2: Words like "at least", "minimum", "must be at least" indicate ≥ constraints.
Tip 3: Always include non-negativity constraints unless explicitly stated otherwise.
Tip 4: Check if any constraints are redundant (one implies another).
Common errors: Forgetting non-negativity constraints, misinterpreting "at least" vs "at most", incorrect inequality direction.
Exam preparation: Practice translating word problems, identify constraint types quickly, check solutions satisfy all constraints.
Essential rules to remember:

• Resource constraint: Total usage ≤ Total availability

• Minimum requirement: Quantity ≥ Required minimum

• Maximum limit: Quantity ≤ Maximum allowed

• Non-negativity: Variables ≥ 0 (unless stated otherwise)

• Equality constraint: Used for exact requirements

Solution: Exercises 4 to 5
4 Nutrition constraint
Exercise 4
A nutritionist wants to create a meal plan with at least 200 calories, at least 20 grams of protein, and at most 30 grams of fat. Food X provides 100 calories, 5g protein, and 2g fat per serving. Food Y provides 50 calories, 8g protein, and 6g fat per serving. Model these nutritional constraints.
Definition:

Nutritional constraints: Dietary requirements expressed as inequalities for calories, proteins, fats, vitamins, etc.

Variables
Let x = servings of X, y = servings of Y
Calorie constraint
100x + 50y ≥ 200
Protein constraint
5x + 8y ≥ 20
Fat constraint
2x + 6y ≤ 30
Step 1: Define variables

Let x = number of servings of food X
Let y = number of servings of food Y

Step 2: Set up calorie constraint

Calories from X: 100x
Calories from Y: 50y
Total calories: 100x + 50y
Requirement: At least 200 calories
So: 100x + 50y ≥ 200

Step 3: Set up protein constraint

Protein from X: 5x grams
Protein from Y: 8y grams
Total protein: 5x + 8y grams
Requirement: At least 20g protein
So: 5x + 8y ≥ 20

Step 4: Set up fat constraint

Fat from X: 2x grams
Fat from Y: 6y grams
Total fat: 2x + 6y grams
Limit: At most 30g fat
So: 2x + 6y ≤ 30

Step 5: Add non-negativity constraints

Cannot consume negative servings: x ≥ 0, y ≥ 0

Step 6: Simplify where possible

Calorie constraint: 100x + 50y ≥ 200 → divide by 50 → 2x + y ≥ 4

Complete constraint system:
2x + y ≥ 4 (calories)
5x + 8y ≥ 20 (protein)
2x + 6y ≤ 30 (fat)
x ≥ 0, y ≥ 0 (non-negativity)
Final answer:

The constraints are: 2x + y ≥ 4, 5x + 8y ≥ 20, 2x + 6y ≤ 30, x ≥ 0, y ≥ 0

Applied rules:

• Minimum requirements: Use ≥ for "at least" conditions

• Maximum limits: Use ≤ for "at most" conditions

• Simplification: Divide by common factors to reduce complexity

5 Staffing constraint
Exercise 5
A store needs to schedule employees for two shifts. Day shift employees work 8 hours and earn $15/hour. Night shift employees work 8 hours and earn $18/hour. The store needs at least 6 employees on day shift and at least 4 on night shift. The total payroll cannot exceed $1200 per day. The store can hire at most 15 employees total. Model these staffing constraints.
Definition:

Staffing constraints: Workforce requirements including minimum staffing levels, budget limits, and capacity constraints.

Variables
Let d = day shift, n = night shift
Payroll constraint
120d + 144n ≤ 1200
Minimum constraints
d ≥ 6, n ≥ 4
Total employees
d + n ≤ 15
Step 1: Define variables

Let d = number of day shift employees
Let n = number of night shift employees

Step 2: Calculate daily pay per employee

Day shift: 8 hours × $15/hour = $120 per employee
Night shift: 8 hours × $18/hour = $144 per employee

Step 3: Set up payroll constraint

Pay for day shift: 120d dollars
Pay for night shift: 144n dollars
Total payroll: 120d + 144n dollars
Payroll limit: $1200
So: 120d + 144n ≤ 1200

Step 4: Set up minimum staffing constraints

At least 6 day shift employees: d ≥ 6
At least 4 night shift employees: n ≥ 4

Step 5: Set up total employees constraint

Total employees: d + n
Maximum allowed: 15
So: d + n ≤ 15

Step 6: Add non-negativity constraints

Cannot have negative employees: d ≥ 0, n ≥ 0 (already satisfied by minimum constraints)

Step 7: Simplify payroll constraint

Divide by 12: 10d + 12n ≤ 100

Complete constraint system:
10d + 12n ≤ 100
d ≥ 6
n ≥ 4
d + n ≤ 15
Final answer:

The constraints are: 10d + 12n ≤ 100, d ≥ 6, n ≥ 4, d + n ≤ 15

Applied rules:

• Payroll calculation: Hours × Rate × Number of employees

• Multiple constraints: Consider all resource limitations

• Capacity limits: Total employees cannot exceed maximum capacity

Complete List of Laws, Methods, Rules, Definitions, Expressions
ax + by ≤ c
General Linear Constraint
Key definitions:

Constraint: A mathematical condition that restricts the possible values of decision variables in an optimization problem.

Linear constraint: An inequality of the form ax + by ≤ c, ax + by ≥ c, or ax + by = c where a, b, c are constants.

Feasible region: The set of all points that satisfy all constraints simultaneously.

Decision variables: The unknowns in the problem that we are trying to determine.

Resource constraint: Limits on available resources like time, money, materials, or personnel.

Minimum requirement: A constraint specifying the lowest acceptable value for a quantity.

Maximum limit: A constraint specifying the highest allowable value for a quantity.

Complete constraint modeling methodology:
  1. Problem analysis: Read the problem carefully and identify all constraints
  2. Variable identification: Determine what quantities are unknown and assign variables
  3. Constraint categorization: Classify constraints as resource limits, minimum requirements, maximum limits, etc.
  4. Mathematical translation: Convert each constraint into a mathematical inequality
  5. Non-negativity check: Ensure all variables are non-negative unless specified otherwise
  6. System formation: Combine all constraints into a system
  7. Verification: Check that all constraints make sense in the context
Tip 1: Keywords for ≤ constraints: "at most", "no more than", "cannot exceed", "maximum", "up to".
Tip 2: Keywords for ≥ constraints: "at least", "minimum", "must be at least", "not less than".
Tip 3: Always consider practical constraints like non-negativity and integer requirements.
Tip 4: Simplify constraints by dividing by common factors to make calculations easier.
Tip 5: Check for redundant constraints that don't add new information to the system.
Common error patterns: Misreading "at least" as "at most", forgetting non-negativity constraints, setting up constraints backwards, missing hidden constraints.
Advanced considerations: Integer constraints, multiple objective functions, sensitivity analysis, slack variables.
Comprehensive constraint formulas:

• Resource constraint: Σ(resource_per_unit × quantity) ≤ total_resource_available

• Minimum requirement: quantity ≥ minimum_required

• Maximum limit: quantity ≤ maximum_allowed

• Ratio constraint: (quantity_A)/(quantity_B) ≤ ratio_limit

• Budget constraint: Σ(cost_per_unit × quantity) ≤ budget

• Capacity constraint: Σ(quantity) ≤ total_capacity

• Balance constraint: quantity_A = quantity_B or quantity_A ≤ k × quantity_B

Questions & Answers

Question: I'm confused about when to use ≤ versus ≥ in constraint modeling. How do I know which inequality sign to use?

Answer: Great question! The key is to focus on the specific words in the problem:

  • Use ≤ (less than or equal) for constraints that represent upper limits or maximums:
    • "at most", "no more than", "cannot exceed", "maximum", "up to"
    • Resource constraints: "have at most 100 hours" → total_hours ≤ 100
  • Use ≥ (greater than or equal) for constraints that represent lower bounds or minimums:
    • "at least", "minimum", "must be at least", "not less than"
    • Requirement constraints: "need at least 20 units" → total_units ≥ 20

Think of it this way: ≤ means "the actual amount is smaller than or equal to the limit", while ≥ means "the actual amount is greater than or equal to the requirement".

Example: "The company has at most $500 to spend" → total_cost ≤ 500
"The company must produce at least 50 units" → total_production ≥ 50

Question: When modeling business constraints, how do I handle situations where I have multiple resources like labor, materials, and time?

Answer: When dealing with multiple resources, you create a separate constraint for each resource:

  • For each resource (labor, materials, time, etc.), write a constraint that says "total usage of this resource ≤ total available of this resource"
  • Each constraint will typically involve all decision variables, weighted by how much of that resource each activity consumes
  • All constraints must be satisfied simultaneously

Example: If producing product A takes 2 hours labor and 3 units of material, and product B takes 1 hour labor and 4 units of material, with 100 hours labor and 150 units material available:
Labor constraint: 2A + 1B ≤ 100
Material constraint: 3A + 4B ≤ 150

This creates a system of constraints that defines the feasible region considering all resource limitations simultaneously.

Question: I often forget to include the non-negativity constraints (x ≥ 0, y ≥ 0). Are these always necessary?

Answer: Yes, non-negativity constraints are almost always necessary in real-world applications because many quantities cannot be negative:

  • You cannot produce a negative number of items
  • You cannot spend a negative amount of money
  • You cannot use a negative amount of resources
  • You cannot hire a negative number of employees

Even if the problem doesn't explicitly state "at least zero," it's implied in most practical contexts. However, there are some specialized cases where negative values might make sense (like temperature or financial positions), but these are rare in basic constraint modeling problems.

As a rule of thumb: unless the problem explicitly allows negative values or you're dealing with a specialized context, always include non-negativity constraints. It's better to include them unnecessarily than to omit them when they're needed.