with(Optimization): with(plots):Warning, the name changecoords has been redefinedBrett StrassnerMA515 Combinatorial Optimization HWProblem 4.5Running the GGMC LP for the original number of resource stock quantities yields the familiar solution given the original c vector and its associated optimal value. To set this up in Maple,make sure to add the option "maximize" since the LPSolve command defaults to a minimization problem. c := Vector([5, 4], datatype=float): A := Matrix([[1,2],[1,1],[2,1]], datatype=float): b := Vector([120,70,100], datatype=float): LPSolve(c, [A, b], assume=nonnegative, maximize);NiM3JCQiJDUkIiIhLUknUlRBQkxFRzYiNiUiKWNRNUMtSSdNQVRSSVhHRik2IzckNyMkIiNJRiY3IyQiI1NGJiZJJ1ZlY3Rvckc2JEkqcHJvdGVjdGVkR0Y5SShfc3lzbGliR0YpNiNJJ2NvbHVtbkdGKQ==constraintsA:={x+2*y<=120, x+y<=70, 2*x+y<=100, x>=0, y>=0}: domainA:=inequal(constraintsA, x=0..100, y=0..100, optionsfeasible=(color=grey), optionsclosed=(color=black, thickness=2), optionsexcluded=(color=white) ):%;LSUlUExPVEc2Ji0lKVBPTFlHT05TRzYoNyY3JCQiIiFGKyQiI2dGKzckRiokIiQrIkYrNyRGL0YvNyRGLyQiIzVGKzcnNyRGKiQiI3FGK0YuRjE3JEYvRio3JEY3Rio3JDckRipGKkYuNyRGPEY5NyZGLkYxRjk3JCQiI11GK0YqLSUmQ09MT1JHNiYlJFJHQkckRjQhIiJGRkZGLUYmNiQ3J0Y8Ri5GMUY5RjwtRkM2JkZFJCIyZ1RrPiI+VEh2ISM8Rk1GTS0lJ0NVUlZFU0c2KTckRjJGKTckRjpGNkY7Rj03JEY/Ri4tRkM2JkZFJEYrRkdGWEZYLSUqVEhJQ0tORVNTRzYjIiIjLSUmU1RZTEVHNiMlLFBBVENITk9HUklERw==It is best to consider each sale of a single resource independently, as an LP altered only with respect to the one constraint. So, we will construct three new LPs.We represent the sale of one unit of labor by decreasing the labor component by one unit. Note that there is no change of either the solution or the optimal value.clabor := Vector([5, 4], datatype=float): A := Matrix([[1,2],[1,1],[2,1]], datatype=float): b := Vector([119,70,100], datatype=float): LPSolve(clabor, [A, b], assume=nonnegative, maximize);NiM3JCQiJDUkIiIhLUknUlRBQkxFRzYiNiUiKTN1ZEMtSSdNQVRSSVhHRik2IzckNyMkIiNJRiY3IyQiI1NGJiZJJ1ZlY3Rvckc2JEkqcHJvdGVjdGVkR0Y5SShfc3lzbGliR0YpNiNJJ2NvbHVtbkdGKQ==constraintsA:={x+2*y<=119, x+y<=70, 2*x+y<=100, x>=0, y>=0}: domainA:=inequal(constraintsA, x=0..100, y=0..100, optionsfeasible=(color=grey), optionsclosed=(color=black, thickness=2), optionsexcluded=(color=white) ):%;LSUlUExPVEc2Ji0lKVBPTFlHT05TRzYoNyc3JCQiIiFGKyQiI3FGKzckRiokIiQrIkYrNyRGL0YvNyRGL0YqNyRGLEYqNyQ3JEYqRipGLjckRjVGMjcmNyRGKiQiMCsrKysrKyZmISM4Ri5GMTckRi8kIjArKysrKytdKiEjOTcmRi5GMUYyNyQkIiNdRitGKi0lJkNPTE9SRzYmJSRSR0JHJCIjNSEiIkZIRkgtRiY2JDcnRjVGLkYxRjJGNS1GRTYmRkckIjJnVGs+Ij5USHYhIzxGUEZQLSUnQ1VSVkVTRzYpNyRGM0YpRjRGNjckRjhGPDckRkFGLi1GRTYmRkckRitGSkZlbkZlbi0lKlRISUNLTkVTU0c2IyIiIy0lJlNUWUxFRzYjJSxQQVRDSE5PR1JJREc=For the sale of a unit of wood, the wood constraint is lowered by one unit. This is represented graphically by transforming the b vector inward, toward the feasible region. This time, the optimal value has decreased by $3.00. This is the amount the buyer would have to pay GGMC for every unit of wood they would like to purchase in order for GGMC not to lose profit.cwood := Vector([5, 4], datatype=float): A := Matrix([[1,2],[1,1],[2,1]], datatype=float): b := Vector([120,69,100], datatype=float): LPSolve(cwood, [A, b], assume=nonnegative, maximize);NiM3JCQiJDIkIiIhLUknUlRBQkxFRzYiNiUiKXdReEEtSSdNQVRSSVhHRik2IzckNyMkIiNKRiY3IyQiI1FGJiZJJ1ZlY3Rvckc2JEkqcHJvdGVjdGVkR0Y5SShfc3lzbGliR0YpNiNJJ2NvbHVtbkdGKQ==constraintsA:={x+2*y<=120, x+y<=69, 2*x+y<=100, x>=0, y>=0}: domainA:=inequal(constraintsA, x=0..100, y=0..100, optionsfeasible=(color=grey), optionsclosed=(color=black, thickness=2), optionsexcluded=(color=white) ):%;LSUlUExPVEc2Ji0lKVBPTFlHT05TRzYoNyY3JCQiIiFGKyQiI2dGKzckRiokIiQrIkYrNyRGL0YvNyRGLyQiIzVGKzckNyRGKkYqRi43JEY2NyRGL0YqNyc3JEYqJCIjcEYrRi5GMUY4NyRGO0YqNyZGLkYxRjg3JCQiI11GK0YqLSUmQ09MT1JHNiYlJFJHQkckRjQhIiJGRkZGLUYmNiQ3J0Y2Ri5GMUY4RjYtRkM2JkZFJCIyZ1RrPiI+VEh2ISM8Rk1GTS0lJ0NVUlZFU0c2KTckRjJGKUY1Rjc3JEY9Rjo3JEY/Ri4tRkM2JkZFJEYrRkdGWEZYLSUqVEhJQ0tORVNTRzYjIiIjLSUmU1RZTEVHNiMlLFBBVENITk9HUklERw==The sale of a unit of metal also decreases the optimal value, but only by $1.00 this time. cmetal := Vector([5, 4], datatype=float): A := Matrix([[1,2],[1,1],[2,1]], datatype=float): b := Vector([120,70,99], datatype=float): LPSolve(cmetal, [A, b], assume=nonnegative, maximize);NiM3JCQiJDQkIiIhLUknUlRBQkxFRzYiNiUiJysjcCktSSdNQVRSSVhHRik2IzckNyMkIiNIRiY3IyQiI1RGJiZJJ1ZlY3Rvckc2JEkqcHJvdGVjdGVkR0Y5SShfc3lzbGliR0YpNiNJJ2NvbHVtbkdGKQ==constraintsA:={x+2*y<=120, x+y<=70, 2*x+y<=99, x>=0, y>=0}: domainA:=inequal(constraintsA, x=0..100, y=0..100, optionsfeasible=(color=grey), optionsclosed=(color=black, thickness=2), optionsexcluded=(color=white) ):%;LSUlUExPVEc2Ji0lKVBPTFlHT05TRzYoNyc3JCQiIiFGKyQiIyoqRis3JEYqJCIkKyJGKzckRi9GLzckRi9GKjckJCIwKysrKysrJlwhIzhGKjcmNyRGKiQiI2dGK0YuRjE3JEYvJCIjNUYrNyc3JEYqJCIjcUYrRi5GMUYyNyRGQEYqNyQ3JEYqRipGLjckRkRGMi0lJkNPTE9SRzYmJSRSR0JHJEY9ISIiRkpGSi1GJjYkNydGREYuRjFGMkZELUZHNiZGSSQiMmdUaz4iPlRIdiEjPEZRRlEtJSdDVVJWRVNHNik3JEYzRik3JEY7Rjg3JEZCRj9GQ0ZFLUZHNiZGSSRGK0ZLRmZuRmZuLSUqVEhJQ0tORVNTRzYjIiIjLSUmU1RZTEVHNiMlLFBBVENITk9HUklERw==TTdSMApJNVJUQUJMRV9TQVZFLzI0MTAzODU2WColKWFueXRoaW5nRzYiNiJbZ2wnIyUhISEiIyIjNDAzRTAwMDAwMDAwMDAwMDQwNDQwMDAwMDAwCjAwMDAwRiYKTTdSMApJNVJUQUJMRV9TQVZFLzI0NTc3NDA4WColKWFueXRoaW5nRzYiNiJbZ2wnIyUhISEiIyIjNDAzRTAwMDAwMDAwMDAwMDQwNDQwMDAwMDAwCjAwMDAwRiYKTTdSMApJNVJUQUJMRV9TQVZFLzIyNzczODc2WColKWFueXRoaW5nRzYiNiJbZ2wnIyUhISEiIyIjNDAzRjAwMDAwMDAwMDAwMDQwNDMwMDAwMDAwCjAwMDAwRiYKTTdSMApJM1JUQUJMRV9TQVZFLzg2OTIwMFgqJSlhbnl0aGluZ0c2IjYiW2dsJyMlISEhIiMiIzQwM0QwMDAwMDAwMDAwMDA0MDQ0ODAwMDAwMDAwCjAwMEYmCg==