1 / 7

HW #1 3.1-11 3.4-6 3.4-14 Due: 2004-10-11

HW #1 3.1-11 3.4-6 3.4-14 Due: 2004-10-11.

aragsdale
Download Presentation

HW #1 3.1-11 3.4-6 3.4-14 Due: 2004-10-11

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. HW #1 3.1-11 3.4-6 3.4-14 Due: 2004-10-11

  2. 3.1-11 The Omega Manufacturing Manufacturing Company has discontinued the production of a certain unprofitable product line. This act created considerable excess production capacity. Management is considering devoting this excess capacity to one ore more of three products; call them products 1, 2, and 3. The available capacity on the machines that might limit output is summarized in the following table: Available Time (Machine Hours per Week) 500 350 150 Machine Type Milling machine Lathe Grinder

  3. The number of machine hours required for each unit of the respective products is Productivity coefficient (in machine hours per unit) Machine Type Milling machine Lathe Grinder Product 1 9 5 3 Product 2 3 4 0 Product 3 5 0 2 The sales department indicates that the sales potential for products 1 and 2 exceeds the maximum production rate and that the sales potential for product 3 is 20 units per week. The unit profit would be $50, $20, and $25, respectively, on products 1, 2, and 3. The objective is to determine how much of each product Omega should produce to maximize profit. (a) Formulate a linear programming model for this problem. (b) Use a computer to solve this model by the simplex method.

  4. 3.4-6 Consider the following LP problem:

  5. Use the graphical method to solve the problem • How does the optimal solution change if the objective function is changed to • ? • How does the optimal solution change if the third constraint is changed to • ?

  6. Alloy 1 2 3 4 5 60 25 45 20 50 10 15 45 50 40 30 60 10 30 10 Property % of tin % of zinc % of lead Cost ($/lb) 22 20 25 24 27 3.4-14 The Metalco company desires to blend a new alloy of 40% tin, 35% zinc, and 25% lead from several available alloys having the following properties.

  7. The objective is to determine the proportions of these alloys that should be blended to produce the new alloy at a minimum cost. (a) Formulate a linear programming model for this problem. (b) Use a computer to solve this model by the simplex method.

More Related