{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Ch.3 - Click to edit Master subtitle style BIT 2406 Chapter...

This preview shows pages 1–13. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Click to edit Master subtitle style 8/15/11 BIT 2406 Chapter 3 BIT 2406 11 8/15/11 BIT 2406 Chapter Topics • Computer Solution • Sensitivity Analysis BIT 2406 22 8/15/11 BIT 2406 Simplex Method • The Simplex method is a procedure involving a set of mathematical steps to solve linear programming problems. • Software for computer solution of linear programming problems is based on the Simplex method. • Tutorial on the Simplex method is included in the online material. • An online tutorial demonstrating the Simplex method, is available here: http://people.hofstra.edu/Stefan_waner/RealWorld/tutorialsf • In this course, we will use Excel Solver to look at BIT 2406 33 8/15/11 BIT 2406 A Maximization Model Example: Product Mix Problem BIT 2406 44 8/15/11 BIT 2406 A Maximization Model Example: Product Mix Problem Bowl Mug RHS Profit (\$/Unit) 40 50 Z Labor (Hrs./Unit) 1 2 40 Clay (Lb./Unit) 4 3 120 BIT 2406 55 Objective: Given the labor and material constraints, the company wishes to know how many bowls and mugs to produce each day in order to maximize profit. Resource 40 hrs of labor per day Availability: 120 lbs of clay 8/15/11 BIT 2406 A Maximization Model Example: Product Mix Problem • Decision x1 = number of bowls to produce per day Variables: x2 = number of mugs to produce per day • Objective maximize Z = 40x1 + 50x2 Function: • Resource 1x1 + 2x2 p 40 hours of labor Constraints: 4x1 + 3x2 p 120 pounds of clay • Non-Negativity x1 „ 0; x2 ˛ 0 Constraints*: BIT 2406 66 *Non-negativity constraints: restrict the decision variables to zero or positive values. 8/15/11 BIT 2406 Spreadsheet Setup BIT 2406 77 8/15/11 BIT 2406 Formula View BIT 2406 88 8/15/11 BIT 2406 Calling and Setting Up Solver BIT 2406 99 5 1 2 3 4 8/15/11 BIT 2406 Solver Options BIT 2406 1010 8/15/11 BIT 2406 Solver Results BIT 2406 1111 8/15/11 BIT 2406 Answer Report BIT 2406 1212 8/15/11...
View Full Document

{[ snackBarMessage ]}

Page1 / 38

Ch.3 - Click to edit Master subtitle style BIT 2406 Chapter...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online