Integer Programming Models

Slides:



Advertisements
Similar presentations
Introduction to LP Modeling
Advertisements

A Multiperiod Production Problem
Solving LP Problems in a Spreadsheet
Example 2.2 Estimating the Relationship between Price and Demand.
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Linear Programming Problem
Session II – Introduction to Linear Programming
Example 5.6 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 6.1 Capital Budgeting Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Tatham Company is considering seven.
Example 14.3 Football Production at the Pigskin Company
Spreadsheet Simulation
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
Example 4.7 Data Envelopment Analysis (DEA) | 4.2 | 4.3 | 4.4 | 4.5 | Background Information n Consider a group of three hospitals.
Example 6.4 Plant and Warehouse Location Models | 6.2 | 6.3 | 6.5 | 6.6 | Background Information n Huntco produces tomato sauce.
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Example 6.2 Fixed-Cost Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Great Threads Company is capable of manufacturing.
Example 5.3 More General Logistics Models | 5.2 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 11.1 Simulation with Built-In Excel Tools.
Example 7.1 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n The Madison.
Example 9.1 Goal Programming | 9.3 | Background Information n The Leon Burnit Ad Agency is trying to determine a TV advertising schedule.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Example 7.6 Facility Location Models | 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information.
Nonlinear Pricing Models
Example 4.4 Blending Models.
 Explore the principles of cost-volume-profit relationships  Perform a basic what-if analysis  Use Goal Seek to calculate a solution  Create a one-variable.
Example 15.2 Blending Oil Products at Chandler Oil
Example 14.1 Introduction to LP Modeling. 14.1a14.1a | 14.2 | Linear Programming n Linear programming (LP) is a method of spreadsheet optimization.
Linear Programming The Industrial Revolution resulted in (eventually) -- large companies, large problems How to optimize the utilization of scarce resources?
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
COMPREHENSIVE Excel Tutorial 10 Performing What-If Analyses.
EXAMPLE: 3.1 ASSEMBLING AND TESTING COMPUTERS
Example 12.6 A Financial Planning Model | 12.2 | 12.3 | 12.4 | 12.5 | 12.7 |12.8 | 12.9 | | | | | | |
Chapter 19 Linear Programming McGraw-Hill/Irwin
Example 16.1 Ordering calendars at Walton Bookstore
Tutorial 10: Performing What-If Analyses
Example 7.2 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n We continue.
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
Example 15.6 Managing Cash Flows at Fun Toys
Example 4.5 Production Process Models | 4.2 | 4.3 | 4.4 | 4.6 | Background Information n Repco produces three drugs, A, B and.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 3 Introduction to Optimization Modeling.
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Example 5.8 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.9 | 5.10 | 5.10a a Background Information.
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Example 2.5 Decisions Involving the Time Value of Money.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
MIS 463: Decision Support Systems for Business Review of Linear Programming and Applications Aslı Sencer.
Example 2.3 An Ordering Decision with Quantity Discounts.
MBA7020_12.ppt/July 25, 2005/Page 1 Georgia State University - Confidential MBA 7020 Business Analysis Foundations Optimization Modeling July 25, 2005.
Optimization using LP models Repco Pharmaceuticals (Ex 4.6) Ravi Krishna Ravula Dsc 8240.
Example 15.7 Capital Budgeting at the Tatham Company Integer Programming Models.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
 Review the principles of cost-volume-profit relationships  Discuss Excel what-if analysis tools 2.
Chapter 7 Systems of Equations and Inequalities Copyright © 2014, 2010, 2007 Pearson Education, Inc Systems of Linear Equations in Two Variables.
Example A Market Share Model | 12.2 | 12.3 | 12.4 | 12.5 | 12.6 |12.7 | 12.8 | 12.9 | | | | | | |
Lab 3 Solver Add-In In Excel ► Lab 2 Review ► Solver Add-in Introduction ► Practice Solver following Instructor » Saferly Inc.
Example 5.10 Project Scheduling Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10a a Background Information.
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
Example 3.1a Sensitivity Analysis and Solver Table Add-in.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
A Multiperiod Production Problem
Project Scheduling Models
Excel Solver IE 469 Spring 2017.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Excel Solver IE 469 Spring 2018.
Excel Solver IE 469 Fall 2018.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Excel Solver IE 469 Spring 2019.
Presentation transcript:

Integer Programming Models Example 15.8 Manufacturing at the Great Threads Company with Fixed Costs Integer Programming Models

Objective To use IP to find the profit-maximizing product mix, using binary variables to deal with the fixed costs.

Background Information The Great Threads Company is capable of manufacturing shirts, shorts, and pants. Each type of clothing requires that Great Threads have the appropriate type of machinery available. The machinery needed to manufacture each type of clothing must be rented at the following rates: shirt machinery, $2500 per week; shorts machinery, $3200 per week; pants machinery, $3000 per week.

Background Information -- continued Each type of clothing requires the amounts of cloth and labor given in the table below. This table also shows the unit variable cost and selling price for each type of clothing.

Background Information -- continued We first note that the cost of producing x shirts during a week is 0 if x=0, but it is 2500+17x if x >0. This cost structure violates the proportionality assumption which is needed for a linear model. If proportionality were satisfied, then the cost of making, say, 10 shirts would be double the cost of making 5 shirts.

Background Information -- continued However, because of the fixed cost, the total cost of making 5 shirts is $2585, and the cost of making 10 shirts is only $2670. The violation of proportionality requires us to resort to 0-1 variables to obtain a linear model.

Solution To model the Great Threads problem, we need to keep track of the following: number of shirts, shorts and pants produced 0-1 variable for each type of clothing that indicates whether any of that type of clothing is produced resource usage of labor and cloth total profit, which equals revenue from sales minus the cost of renting machines minus the variable cost of producing clothing.

THREADS.XLS This file provides the setup to develop the model seen on the next slide.

Developing the Model The model can be formulated as follows: Inputs. Enter the given inputs in the ranges. 0-1 values for shirts, short, and pants. Enter any trial values for the 0-1 variables for shirts, shorts, and pants in the ProduceAny range. Shirts, shorts and pants produced. Enter any trial values for the number of shirts, shorts and pants produced in the Produced range.

Developing the Model -- continued Labor and cloth used. Calculate the total amount of labor hours used by entering the formula =SUMPRODUCT(Produced,B6:D6) in cell B23. Then copy this to cell B24 to calculate the amount of cloth used. Upper limits on production quantities. Now we come to the tricky part of the formulation. We need to ensure that if any of the given type of clothing is produced, then its 0-1 variable equals 1. This ensures that the model incurs that cost of renting a machine for this type of clothing. We could easily implement these with IF statements but Solver is unable to deal with IF statements. Therefore, instead we model the fixed cost constraints as follows Shirts produced <= (Maximum number of shirts that could be produced) * (0-1 variable for shirts).

Developing the Model -- continued Upper limits on production quantities - continued. To implement this inequality we need an upper limit on the number of shirts that could be produced. However, observe that the number of shirts that could be produced is limited by the smaller of (Available labor hour/Labor hour per shirt) and (Available square yards of cloth/Square yards of cloth per shirt) Therefore, the smaller of these can be used as the maximum needed in the inequality. So in cell B8 we calculate an upper limit on the number of shirts that could be produced with the formula =MIN($D$23/B6,$D$24/B7) Then we copy this formula to the range C8:D8 for shorts and pants. For example, we see that at most min{(1500/1), (800/4)} = 1500 shirts could be produced.

Developing the Model -- continued Effective capacities. Now we model the fixed cost constraints in the rows 18 to 20. The left-hand sides are already in the Produced range. Generate the right-hand sides of the fixed cost constraints in the Capacity range. Specifically, calculate the right-hand side of the inequality by entering the formula =B8*B16 in cell B20 and copying it across row 20. Revenues and costs. Calculate the total sales revenue in cell B27 and the total variable cost in the cell B28 with the formulas =SUMPRODUCT(B10:D10,Produced) and =SUMPRODUCT(B11:D11,Produced). Then calculate the total fixed cost in the FixedCost cell with the formula =SUMPRODUCT(B12:D12,ProduceAny).

Developing the Model -- continued Revenues and costs - continued. Note that this formula picks up the fixed costs for only those products with 0-1 variables equal to 1. Finally, calculate the total profit in the Profit cell with the formula =B27-SUM(B28:B29)

Using Solver The Solver dialog box should be completed as shown here. We maximize profit, subject to not using more hours or cloth than is available, and we ensure that production is no greater than effective capacity. The key is that this effective capacity is 0 if we decide not produce any of the given product.

Optimal Solution From the optimal solution we see that Great Threads should produce 1667 pairs of pants but no shirts or shorts. The total profit is $18,667. It might be helpful to think of this solution occurring in two stages: In the first stage Solver determines which products to produce. In the second stage Solver specifies how many pairs of pants to produce.

Optimal Solution -- continued The Great Threads management might not be very excited about being a pants-only shop. Suppose they wanted to ensure that at least two types of clothing are produced at positive levels. One approach to do this would be to add another constraint, namely, that the sum of the 0-1 values in row 16 is greater than or equal to 2. When Solver reruns, the 0-1 variable for shirts becomes 1, but no shirts are produced! To force the company to produce shirts, we would need to add constraints which would cost Great Threads money.