deletions | additions       diff --git a/Optimization Models.tex b/Optimization Models.tex  index 32b99fd..c095048 100644  --- a/Optimization Models.tex  +++ b/Optimization Models.tex 
...
\section{Approach to solution} \section{Solution}  In general, a 100✕100 square lattice (representing 5cm by 5cm) was used to generate random tumors of discrete shapes and sizes. Non-intersecting circles were then placed randomly on the lattice, and a genetic algorithm was used to optimize circle placement and radii for accuracy. At no point was a circle allowed to intersect with another. In this way, the problem was generalized to a problem of circle-packing within randomly sized polygons within a square lattice.