When a problem has many possible solutions, math can compare them all at once. You assign each possible tower location in Kern County a value based on population density and highway traffic, building a math copy of the county's geography. Three different models come out of that equation — one that picks the most profitable spots with fewer towers, one that spreads towers for the widest coverage, and a third that balances both. Each strategy gets tested before a single tower is built.

Linear programming finds the best option from a set of choices that each have limits. When you assign each possible location a value based on population density and highway traffic, you define the inputs that the method weighs against constraints like budget and coverage area. The result is not just one answer but several: one model picks the most profitable spots, another maximizes coverage, and a third balances both, showing how different objective functions reshape which choice counts as "best."

Can math find the best spots to build cell phone towers? In this project, each possible tower location in Kern County gets an optimization value based on population density and highway traffic. Three different models emerge from the math: one picks the most profitable spots with fewer towers, another spreads towers out for the widest coverage, and a third balances profit and coverage. Comparing these setups reveals how different goals change which arrangement counts as best — and adjusting for population growth shows how those ideal locations shift over time.