Linear Programming The purpose of this LRE is to introduce you to linear programming in anticipation of Week 5. It is also to ensure you have Microsoft Excel and Solver up and running before you need them next week. It is a required assignment. It is marked only PASS/FAIL, and you must pass through revisions if necessary. This LRE assumes you have read and understood the linear programming materials for this course, including the Jacobs, Appendix A, and Professor Steve Knode’s lectures. It also assumes you have installed Solver in your version of Excel (see Jacobs’ Appendix for a note on how to do this, or simply run an Internet search for “how do I install Solver in Excel?”) Please submit all your answers to the following in Excel. Clearly label your work and make it easy to grade! 1. Write a formulation of the “Puck and Pawn” linear programming problem. A formulation will contain a. The problem statement (what do you want to do? Maximize or minimize something?) b. a variable definition (“Let X = …” You may choose whatever variable names you like) c. the objective function (“Max Q = …” or “Min Q = …” Again, pick your own variable names) d. the constraints (“subject to…” and then a listing of equations) e. Non-negativity (are any variables required to be >= 0? If so, which ones?) Note a formulation does not contain the solution – the formulation is just the problem setup! (You can check your formulation against that presented in the Jacobs textbook. 2. Set your Puck and Pawn formulation up in Excel. There is a portion of the Jacobs Appendix titled “Linear Programming Using Microsoft Excel” which you may find helpful. You will know you have done this when you have something that looks like this screen shot from Jacobs in your Excel screen. 3. Assume you have decided to make 5 hockey sticks and 3 chess sets. All of the rest of the problem (profit margins, constraints) remains the same as in the textbook. a. What is the value of your objective.
Tuesday, 24 June 2014
Linear Programing
Document Preview:
Linear Programming The purpose of this LRE is to introduce you to linear programming in anticipation of Week 5. It is also to ensure you have Microsoft Excel and Solver up and running before you need them next week. It is a required assignment. It is marked only PASS/FAIL, and you must pass through revisions if necessary. This LRE assumes you have read and understood the linear programming materials for this course, including the Jacobs, Appendix A, and Professor Steve Knode’s lectures. It also assumes you have installed Solver in your version of Excel (see Jacobs’ Appendix for a note on how to do this, or simply run an Internet search for “how do I install Solver in Excel?”) Please submit all your answers to the following in Excel. Clearly label your work and make it easy to grade! 1. Write a formulation of the “Puck and Pawn” linear programming problem. A formulation will contain a. The problem statement (what do you want to do? Maximize or minimize something?) b. a variable definition (“Let X = …” You may choose whatever variable names you like) c. the objective function (“Max Q = …” or “Min Q = …” Again, pick your own variable names) d. the constraints (“subject to…” and then a listing of equations) e. Non-negativity (are any variables required to be >= 0? If so, which ones?) Note a formulation does not contain the solution – the formulation is just the problem setup! (You can check your formulation against that presented in the Jacobs textbook. 2. Set your Puck and Pawn formulation up in Excel. There is a portion of the Jacobs Appendix titled “Linear Programming Using Microsoft Excel” which you may find helpful. You will know you have done this when you have something that looks like this screen shot from Jacobs in your Excel screen. 3. Assume you have decided to make 5 hockey sticks and 3 chess sets. All of the rest of the problem (profit margins, constraints) remains the same as in the textbook. a. What is the value of your objective.
Linear Programming The purpose of this LRE is to introduce you to linear programming in anticipation of Week 5. It is also to ensure you have Microsoft Excel and Solver up and running before you need them next week. It is a required assignment. It is marked only PASS/FAIL, and you must pass through revisions if necessary. This LRE assumes you have read and understood the linear programming materials for this course, including the Jacobs, Appendix A, and Professor Steve Knode’s lectures. It also assumes you have installed Solver in your version of Excel (see Jacobs’ Appendix for a note on how to do this, or simply run an Internet search for “how do I install Solver in Excel?”) Please submit all your answers to the following in Excel. Clearly label your work and make it easy to grade! 1. Write a formulation of the “Puck and Pawn” linear programming problem. A formulation will contain a. The problem statement (what do you want to do? Maximize or minimize something?) b. a variable definition (“Let X = …” You may choose whatever variable names you like) c. the objective function (“Max Q = …” or “Min Q = …” Again, pick your own variable names) d. the constraints (“subject to…” and then a listing of equations) e. Non-negativity (are any variables required to be >= 0? If so, which ones?) Note a formulation does not contain the solution – the formulation is just the problem setup! (You can check your formulation against that presented in the Jacobs textbook. 2. Set your Puck and Pawn formulation up in Excel. There is a portion of the Jacobs Appendix titled “Linear Programming Using Microsoft Excel” which you may find helpful. You will know you have done this when you have something that looks like this screen shot from Jacobs in your Excel screen. 3. Assume you have decided to make 5 hockey sticks and 3 chess sets. All of the rest of the problem (profit margins, constraints) remains the same as in the textbook. a. What is the value of your objective.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment