BackPrecalculus Study Notes: Linear Systems, Word Problems, and Linear Programming
Study Guide - Smart Notes
Tailored notes based on your materials, expanded with key definitions, examples, and context.
Linear Equations and Systems
Solving Systems of Linear Equations
Systems of linear equations are sets of two or more equations with multiple variables. Solving these systems allows us to find values for the variables that satisfy all equations simultaneously.
Definition: A system of linear equations consists of two or more linear equations with the same set of variables.
Methods of Solution:
Substitution: Solve one equation for one variable and substitute into the other.
Elimination: Add or subtract equations to eliminate a variable.
Graphical: Plot both equations and find the intersection point.
Example: Find two numbers whose sum is 12 and difference is 4.
Let and be the numbers.
Solving: ,
Word Problems Involving Linear Equations
Many real-world problems can be modeled using linear equations. These often involve costs, quantities, or measurements.
Example: At a restaurant, the cost for a breakfast taco and a small glass of milk is $2.10. The cost for 2 tacos and 3 small glasses of milk is $5.15. Find the cost of a taco and a small glass of milk.
Let = cost of taco, = cost of milk.
Solving: ,
Applications of Linear Equations
Business and Inventory Problems
Linear equations are used to solve problems involving sales, inventory, and cost calculations.
Example: The Frosty Ice-Cream Shop sells sundaes for $2 and banana splits for $3. On a hot summer day, the shop sold 8 more sundaes than banana splits and made $100.
Let = number of sundaes, = number of banana splits.
Solving: ,
Geometry and Measurement Problems
Linear equations can be used to solve geometric problems involving perimeter, area, and dimensions.
Example: The perimeter of a rectangular wooden deck is 90 feet. The deck's length, , is 5 feet less than 4 times its width, . Write and solve a system of linear equations to determine the dimensions.
Solving: ft, ft
Linear Programming
Introduction to Linear Programming
Linear programming is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships.
Key Terms:
Constraints: Linear inequalities that restrict the values of variables.
Objective Function: The function to be maximized or minimized (e.g., profit, cost).
Feasible Region: The set of all possible solutions that satisfy the constraints.
Steps in Linear Programming:
Define variables.
Write constraints as inequalities.
Write the objective function.
Graph the feasible region.
Find the optimal value at a vertex of the feasible region.
Examples of Linear Programming Problems
Example 1: Bob builds tool sheds. He has 10 sheets of dry wall and 15 studs for a small shed, and 15 sheets of dry wall and 45 studs for a large shed. He has available 60 sheets of dry wall and 135 studs. If he makes $390 profit on a small shed and $520 on a large shed, how many of each type should he build to maximize profit?
Let = number of small sheds, = number of large sheds.
Constraints:
(dry wall)
(studs)
Objective function:
Solution: 3 small and 2 large sheds
Example 2: A toy manufacturer wants to minimize cost for producing two lines of toy airplanes. Each Flying Falcon costs $600$ to build. What is the minimum cost per day?
Let = number of Flying Falcons, = number of Flying Hawks.
Constraints based on production limits.
Objective function:
Solution: $600$
Tables: Linear Programming Solutions
Summary Table of Linear Programming Problems
Problem | Variables | Constraints | Objective Function | Optimal Solution |
|---|---|---|---|---|
Tool Sheds | Small sheds (), Large sheds () |
| 3 small, 2 large | |
Toy Wagons | Small wagons (), Large wagons () |
| 6 small, 4 large | |
Farm Planting | Acres of wheat (), Acres of rye () |
| 40 acres wheat, 4 acres rye | |
Ore Processing | Tons from source A (), Tons from source B () |
| 2 tons A, 4 tons B | |
Factory Products | Products from Factory X (), Products from Factory Y () |
| 1200 products from Factory X, 0 from Factory Y |
Additional Info
Linear programming problems often require graphing the feasible region and checking the vertices for optimal solutions.
Constraints can be equalities or inequalities, and the solution must satisfy all constraints.
Objective functions are typically maximized (profit) or minimized (cost).