This action might not be possible to undo. Are you sure you want to continue?

Welcome to Scribd! Start your free trial and access books, documents and more.Find out more

They grind their own flour for the hot dog buns at a maximum rate of 200 pounds per week. Each hot dog bun requires 0.1 pound of flour. They currently have a contract with Pigland, Inc., which specifies that a delivery of 800 pounds of pork product is delivered every Monday. Each hot dog requires ¼ pound of pork product. All the other ingredients in the hot dogs and hot dog buns are in plentiful supply. Finally, the labor force at Weenies and Buns consists of 5 employees working full time (40 hours per week each). Each hot dog requires 3 minutes of labor, and each hot dog bun requires 2 minutes of labor. Each hot dog yields a profit of $0.80, and each bun yields a profit of $0.30. Weenies and Buns would like to know how many hot dogs and how many hot dog buns they should produce each week so as to achieve the highest possible profit. (a) Formulate a linear programming model for this problem. (b) Use the graphical method to solve this model. a) x1: # hot dogs they should produce each week x2: # hot dog buns they should produce each week Objective is maximize the profit so; Max Z = 0,80 x1 + 0,30 x2 Flour constraint: 0,1 x2 ≤ 200 Pork product constraints: ¼ x1 ≤ 800 0,25 x1 ≤ 800 Labor constraint: 3x1+2x2 ≤ 12000 (40 hours = 2400 minutes, 2400 minutes per worker, so for 5 worker= 2400*5 =12000 minutes) Non-negativity; x1, x2 ≥ 0 So LP for this problem: Max Z = 0,80 x1 + 0,30 x2 St; 0,1 x2 ≤ 200 0,25 x1 ≤ 800 3x1+2x2 ≤ 12000 b) 1) 0,1 x2 = 200 x2 = 2000 2) 0,25 x1 = 800 x1 = 3200 3) 3x1+2x2 = 12000 (0, 6000 ) and (4000,0)

Optimal Solution: x1*=3200 . x2*=1200 and Z*=2920 .

x1. Max Z = 50 x1 +20 x2 +25 x3 Constraints: Machine Hours for Milling Machine: 9 x1 +3 x2 +5 x3 ≤ 500 Machine Hours for Lathe: 5 x1 +4 x2 ≤ 350 Machine Hours for Grinder: 3 x1 + 2 x3 ≤ 150 Sales Potential: x3≤ 20 Non-negativity.3 x1: # Product 1 x2: # Product 2 x3: # Product 3 Objective is to maximize the profit. 2.2.3. $20. The unit profit would be $50. call them products 1. 2. x3≥ 0 . on products 1. and $25.1-11 The Omega Manufacturing Company has discontinued the production of a certain unprofitable product line. x2. respectively. axi =the number of units of product i produced for i=1. The objective is to determine how much of each product Omega should produce to maximize profit. This act created considerable excess production capacity. (a) Formulate a linear programming model for this problem. The available capacity on the machines that might limit output is summarized in the following table: The number of machine hours required for each unit of the respective products is 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. and 3. (b) Solve this model by the simplex method. Management is considering devoting this excess capacity to one or more of three products. and 3.

And s3 is the leaving variable since 50.1/3 -2 2/3 1 s1 0 1 0 0 0 s1 0 1 0 0 0 s1 6 2/3 1/3 -1 1/3 0 0 s2 0 0 1 0 0 s2 0 0 1 0 0 s2 0 0 1 0 0 s3 0 0 0 1 0 s3 16 2/3 -3 -1 2/3 1/3 0 s3 -3 1/3 -1 2 1/3 1/3 0 s4 0 0 0 0 1 s4 0 0 0 0 1 s4 0 0 0 0 1 RHS 0 500 350 150 20 RHS 2500 50 100 50 20 RHS Z s1 s2 x1 1 s4 min ratio test 16 2/3 25 Z x2 s2 x1 2 s4 min ratio 2833 1/3 test 16 2/3 33 1/3 14 2/7 50 150 20 Min ratio test= RHS values/coef. Of ent.b. And then we divide whole row to 3: .25 x3 St 9 x1 + 3 x2 +5 x3 + s1 5 x1 + 4 x2 + s2 3 x1 + +2 x3 + s3 x3 + s4 x1. is the minimum one.Simplex: Objective function: Z -50 x1 -20 x2 .0 = 500 =350 = 150 = 20 iteration Z s1 s2 s3 0 s4 x1 -50 9 5 3 0 x1 0 0 0 1 0 x1 0 0 0 1 0 x2 -20 3 4 0 0 x2 -20 3 4 0 0 x2 0 1 0 0 0 x3 -25 5 0 2 1 x3 8 1/3 -1 -3 1/3 2/3 1 x3 1 2/3 .6 70. So for that. x3 s1 s2 s3≥ 0 solution is on excel sheet Manuel solution: min ratio test 55. we divide 3 to 3 and we get 1.from minimum ratio test. x2. Variable For the first iteration. we see that x1 is entering variable since -50 is the most minimum one. We want the intersection of entering variable and leaving variable (pivot cell) is to be 1.0 50.

Z s1 s2 x1 1 s4 x1 0 0 0 1 (3/3) 0 x2 -20 3 4 0 (0/3) 0 x3 8 1/3 -1 -3 1/3 2/3(2/3) 1 s1 0 1 0 0 (0/3) 0 s2 0 0 1 0 (0/3) 0 s3 16 2/3 -3 -1 2/3 1/3(1/3) 0 s4 0 0 0 0 (0/3) 1 RHS 2500 50 100 50 (150/3) 20 .

- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- LinearProgramming1.docx
- gridworld_solutions_doc.pdf
- ComputerGraphics_CS602_1_SOL.do
- cmpe343_spring10_ps6_sol.pdf
- answerset_5std.doc
- answers_SupplyChain.doc
- 10.1.1.178.8650.pdf
- BoundedVariableSimplexMethod

LinearProgramming1.docx

LinearProgramming1.docx

- 2 Linear Programming
- This is your lucky day
- Yale Casebook 2013 Full-6
- Ib quiz 12
- Economics
- Pareto Analysis
- ACCOUR
- Classic Pen Company_Group 07_v1
- Integration Aspects
- Inter Process Profits
- Managerial Economics and Financial Analysis Nov2004 Rr 310106
- Untitled
- 7110_w10_ms_2
- Chapter 5
- 4720 Financial Analysis Guide
- Productivity Linked in Service sector
- Does working capital management affect profitability of belgian firms
- ProblemSolvingProjectProposal F
- LG H&H 2012_4Q Earnings Presentation
- Fixed Capital Investment
- Single-threaded Tatted Platonic Solids Tutorial
- Detailed TOC
- 183613 Specimen Papers Web Version
- Modeling Optimization 2013
- May 09 FA MAN2907L Marking Scheme
- CAP
- ABC
- Liquidity Ratio Presentation
- Ratio Analysis Project
- Finance Report.bcom b.docx 2

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd