An application to maximise profits, with the given types of lamps, bass, and platinum. Maximize, has 2 inputs with their coefficients. Assembly has 3 inputs, each being its respective coefficients, and Max demand has 1 input. The coefficents are aB+ bP = cC where B is brass, P is platinum, and C is the constant, with the input [a,b,c]. The inputs are interpreted into functions where it is drawn on the graph. There will be a feasible region where all boundaries will be satisfied. The program then picks all the intersections within the feasible region(note that some points will not be accounted for). The output just gives the profits given at that point on the graph.