Awesome Optimizing Wizard that you are, Dumbledore has approached you to make wands for the wizarding community. Dumbledore would like for you to make quantities of two types of wands that require different types of magical components.
Each Hufflepuff wand requires one phoenix tail feather and 2 feet of olive wood. Each Gryffindor wand requires 3 phoenix tail feathers and 2 feet of olive wood. You have 200 tail feathers and 300 feet of wood at your disposal.
Your objective in making the wands is to maximize the total magic produced. Each Hufflepuff wand counts for one unit of magic, and each Gryffindor wand will bring 2 units of magic. Dumbledore has decreed that at most 60 Gryffindor wands can be made.
1 Problem Write a instance of a linear program that will maximize the magic in the wands produced.
2 Problem Write your linear program from Problem 2.1 in the AMPL modeling language and solve the problem. Have your AMPL program print the optimal solution values and the optimal objective function value. Problem Set #1 Page 1 ISyE 323 Problem Set #1 Fall 2016 Prof. Jeff Linderoth Also write the optimal solution on your paper to turn in. Turn in the AMPL program and data to the dropbox.
3 Problem Solve the problem using the graphical method.