This document discusses solving a linear programming problem to maximize profit given two decision variables (number of newspaper and social media ads) and two constraints (budget and work hours). It presents the decision variables, objective function to maximize profit, constraints, graphing the feasible region, identifying the extreme points, and using simultaneous equations and the multiplication method to find the optimal solution where the constraints intersect at (76.92, 9.23). This maximizes profit of $326 given the budget of $240 and 100 work hours available.