Homework 1 Fall 2000 ENM3 82.1

Similar documents
MBF1413 Quantitative Methods

Chapter 11. Decision Making and Relevant Information Linear Programming as a Decision Facilitating Tool

Econ 172A, Fall 2010: Quiz III IMPORTANT

Chapter 16 Sl Sales and doperations Planning

Inventory & Supply Chain Management Prof. Apurva Jain

MTBE Chemical Production Optimization

MGSC 1205 Quantitative Methods I

KPI ENCYCLOPEDIA. A Comprehensive Collection of KPI Definitions for PROCUREMENT

Decision making and Relevant Information

MGSC 1205 Quantitative Methods I

Antti Salonen KPP227 KPP227 1

Problem Set 4 Duality, Sensitivity, Dual Simplex, Complementary Slackness

Aggregate Planning Exercise

AGENDA: DIFFERENTIAL ANALYSIS: THE KEY TO DECISION MAKING

Mid Term Solution. T7, T8, T20 pounds of tomatoes to sell in weeks 7, 8, 20. F7, F8, F20 - pounds of tomatoes to freeze in weeks 7, 8, 20.

Best Practices for Transportation Management

DIS 300. Quantitative Analysis in Operations Management. Instructions for DIS 300-Transportation

Using Excel s Solver

Transfer Pricing Cost Accounting Horngreen, Datar, Foster

Financial Accounting Chapter 6 Notes Inventories

Aggregate Planning (session 1,2)

Ch.01 Introduction to Modeling. Management Science / Instructor: Bonghyun Ahn

Managerial Decision Modeling w/ Spreadsheets

AGGREGATE PLANNING PROBLEMS

Required If the Bath Department is dropped, what will be the effect on the operating income of the company as a whole?

David Simchi-Levi M.I.T. November 2000

Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard. Inventory Level. Figure 4. The inventory pattern eliminating uncertainty.

3/10/2016. Sales Metrics Are your measurements driving the right behavior? Joel Galassini

(4 Marks) (b) Enumerate the industrial applications of linear programming.

P2 Performance Management

2. Find solution of following LPPs and solution of their dual problem too: a.

Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle

IM3 - Lesson 5: Systems with Quadratics Unit 3 Quadratic Functions PART 2

National Institute of Technology Calicut Department of Mechanical Engineering PRODUCTION PLANNING (AGGREGATE PLANNING)

BioPharma A Global Supply Chain Network

DECISION MAKING. Key Topics to Know

Differential Analysis: Relevant Costs the Key to Decision Making

This is a refereed journal and all articles are professionally screened and reviewed

Producing Goods & Services

Microeconomic Theory -1- Introduction and maximization

36106 Managerial Decision Modeling Revenue Management

P1 Performance Operations

CHAPTER 5 SUPPLIER SELECTION BY LEXICOGRAPHIC METHOD USING INTEGER LINEAR PROGRAMMING

If you have never done this before - go to CASA for fingerprint/picture process before your test date.

Math 1314 Lesson 8 Business Applications: Break Even Analysis, Equilibrium Quantity/Price

Introduction to Management Science, 10e (Taylor) Chapter 4 Linear Programming: Modeling Examples

The integration of online and offline channels

Linear programming A large number of decision pr

Paper P2 Performance Management (Russian Diploma) Post Exam Guide May 2012 Exam. General Comments

Production Planning under Uncertainty with Multiple Customer Classes

P2 Performance Management

SEQUENCING & SCHEDULING

Inventory Routing Problem for the LNG Business

Change in Overhead Cost Change in Production Units

Introduction to Production Planning

Introduction to Management Science 8th Edition by Bernard W. Taylor III. Chapter 1 Management Science

B.5 Binary Indicator Variables Review Questions

Relevant Costs for Decision Making

Introduction to quantitative methods

Inventory Model Involving Controllable Lead Time through New Approach

10-1. Learning Objective. Identify relevant and irrelevant costs and benefits in a decision.

Modeling Using Linear Programming

CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS

Suez Canal. Pipeline Suez

Cost concepts for decision making. Management Accounting Fundamentals. Part 1. Topic 9.1

The Blending Model. Example Example 2.2.2

Supply Chain Inventory Management Chapter 9. Copyright 2013 Pearson Education, Inc. publishing as Prentice Hall 09-01

MASSACHUSETTS INSTITUTE OF TECHNOLOGY

INVENTORY DYNAMICS IMPLEMENTATION TO A NETWORK DESIGN MODEL

Parwadi Moengin, Member IAENG

Optimizing the Supply-Chain Configuration for New Products

Reading Essentials and Study Guide

Multi-Period Cell Loading in Cellular Manufacturing Systems

TRANSPORTATION PROBLEM AND VARIANTS

Oracle Sales and Operations Planning (S&OP) Cloud - Revenue and Cost Calculations

Chapter 4. Models for Known Demand

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Chapter 22 Homework Solution

Problem #44. Problem #45

Cycle of costing accounting

Producing Goods & Services

The Training Material on Logistics Planning and Analysis has been produced under Project Sustainable Human Resource Development in Logistic Services

Choices we make in the food supply chain. Pallet Manufacturer Raw Material Supplier Food Manufacturer

Investments into forest biorefineries under different price and policy structures

A Model of Monopoly. Monopoly Profit Maximization. The Monopolist s Price and Output Numerically. The Monopolist s Price and Output Numerically

The lead-time gap. Planning Demand and Supply

The LNG Inventory Routing Problem with Pick-Up Contracts

Performance Management

15 (See Example E later in this lab)

TABLE OF CONTENTS. Question Paper. Answer 1. Answer 2. Answer 3. Answer 4. Soft Copy

Identifying Relevant Costs. Identifying Relevant Costs. Identifying Relevant Costs. A relevant cost is a cost that differs between alternatives.

An Introduction to Cost Terms and Purposes. Dr. Osama Al Meanazel

OMGT2146. Supply Chain Analysis and Design. Introduction to Modeling. Course Information. Week 1

Chapter 6: Sellers and Incentives

Basic Linear Programming Concepts. Lecture 2 (3/29/2017)

Section 2.5, 2.6 & 2.7 Worksheet. Optimization

EconS Bertrand Competition

Revenue management under demand uncertainty: the case for a robust optimization approach

QUANTITATIVE TECHNIQUES SECTION I

MSMGT 782 Lesson 2 Important note: Transcripts are not substitutes for textbook assignments.

Transcription:

Homework 1 Fall 2000 ENM3 82.1 Jensen and Bard, Chap. 2. Problems: 11, 14, and 15. Use the Math Programming add-in and the LP/IP Solver for these problems. 11. Solve the chemical processing example in Section 2.8 using a computer program. Investigate the effect of the following changes separately. The changes are not cumulative. a. Eliminate the upper bound on sales for product X. b. Eliminate the upper bound on the manufacture of X, but assume any amount produced over 5000 must be discarded at a cost of $1/lb. c. Eliminate the restriction on the amount of raw material B that can be purchased. d. Change the cost of raw material C to $5/lb. Base Total 136857 0 5000 16071.4 7142.86 1547.62 357.143 5238.1 5000 1428.57 714.286 15476.2 4642.86 10833.3 4642.86 9285.71 1547.62 5000 6071.43 9285.71 500 5571.43 Part a Remove the upper limit on the production of X Total 145000 136857 115000 251857 0 5000 18500 10000 1500 500 8000 7000 2000 1000 15000 4500 10500 4500 9000 1500 7000 6500 9000 500 6000 The limit on the mix amount becomes tight. 1

Part b. The solution of the base case results. It is not beneficial to make more X if it is thrown away for a cost $1. Part c. Remove the restriction on B Total 498286 0 20714.3 47500 7142.86 6785.71 357.143 0 5000 1428.57 714.286 67857.1 20357.1 47500 20357.1 40714.3 6785.71 5000 21785.7 40714.3 500 21285.7 The limit on the amount of X is constraining the solution. Part d. Change the unit cost on C to $5 Total 77809.5 5238.1 5000 10833.3 7142.86 6785.71 357.143 0 5000 1428.57 714.286 15476.2 4642.86 10833.3 4642.86 9285.71 1547.62 5000 6071.43 9285.71 500 5571.43 The product amounts don't change, but the raw material mix changes. 2

14. A company has two manufacturing plants (A and B) and three sales outlets (I, II, and III). Shipping costs from the plants to the outlets are as follows. Outlet Plant I II III A 4 6 8 B 7 4 3 The company wants to plan production, shipping and sales for the next two periods. The data for the periods is shown below. The plants can store products produced in one period for sale in the next. The maximum storage at each plant is 50 and the inventory cost is $1 per unit. Find the solution that maximizes profit. Plant A Manufacturing data Plant B Period Unit cost ($) Capacity Unit cost ($) Capacity 1 8 175 7 200 2 10 150 8 170 Selling price ($) Demand Data Maximum sales Period I II III I II III 1 15 20 14 100 200 150 2 18 17 21 150 300 150 Answer: Network model. (1,50) [0,-100,-15] [0,175,8] (4) I1 (4) A1 (6) [0,-200,-20] A2 (8) (6) [0,150,10] II1 (8) [0,200,7] (7) [0,170,8] (7) [0,-150,-14] B1 (4) B2 (4) (3) III1 (3) (1,50) [0,-150,-18] I2 [0,-300,-17] II2 [0,-150,-21] III2 [Fixed, Slack, Cost] (Cost, Capacity) Use these variables PA1, PB1, PA2, PB2: production at A and B in the two periods S11, S21, S31: sales in period 1 at three locations S12, S22, S42: sales in period 2 at three locations 3

xa11, xa21, etc: shipments in period 1 xa12, xa22, etc: shipments in period 2 IA, IB: Inventory storage at A and B Max profit: Z = 15S11 + 20S21 + sales revenue - 8PA1-7PB1 - production costs - 4xA11 - xa21 - transportation costs - 1IA - 1IB Conservation constraints and upper limits on variables. Maxprofit = Z = 4375 4

15. A company is planning its aggregate production schedule for the next three months. Units may be produced on regular time or overtime. The relevant costs and capacities are shown in the table below. The demand for each month is also shown. There are three ways of meeting this demand: inventory, current production, and backorders. Units produced in a particular month may be sold in that month or kept in inventory for sale in a later month. There is a $1 cost per unit for each month an item is held in inventory. Initially, there are 15 units in inventory. Also, sales can be backordered at a cost of $2/unit/mo. Backorders represent production in future months to satisfy demand in past months, and hence incur an additional cost. Capacity (units) Production cost ($/unit) Period Regular time Overtime Regular time Overtime Demand 1 100 20 14 18 60 2 100 10 17 22 80 3 60 20 17 22 140 a. Develop a model that when solved will yield the optimum production plan. Find the solution with a computer program. b. How would the model change if the inventory cost depends on the total time an item is stored. Let the cost be $1/unit for items kept in inventory for 1 month, $3 for items kept for 2 months, and $5 for items kept for 3 months. Assume that the initial inventory has been in storage for 1 month. Solve the model with this change. a. Solution Variables for part a R k = Regular production in month k O k = Overtime production in month k I k = Inventory stored in month k B k = items backordered from month k 5

15 Initial Inv. R1 (Regular prod.) O1 (Regular prod.) 1 (60) Demand Conservation of product R1 + O1 - I1 + B2 = 60-15 R2 + O2 + I1 - I2 - B2 + B3 = 80 I1 B2 R3 + O3 + I2 - B3 = 140 R2 (Regular prod.) O2 (Regular prod.) 2 (80) Demand Limits on regular production R1 100, R2 100, R3 60 O1 20, O2 10, O3 20 R3 (Regular prod.) O3 (Regular prod.) I2 3 B3 (140) Demand Objective: Minimize cost Z = 14R1 + 17R2 + 17R3 (regular prod. + 18O1 + 22O2 + 22O3 (overtime prod.) + 1(I1 + I2) (inventory) + 2(B2 + B3) (backorder) Solution (Sheet Agg_16) z = 4350. The cost is $15 greater if initial inventory is charged. Period Regular Production Overtime Production Inventory to Next Period Backorder to Previous Period 1 100 5 60 --- 2 100 0 80 0 3 60 0 --- 0 6

b. Variables for part b We have all the variables except I k : we break the inventory into parts depending on how many months passed until they are used. I1 k is the number used after 1 month, I2 k is the number used after 2 months and I3 k is the number used after 3 months. 15 Initial Inv. R1 (Regular prod.) O1 (Regular prod.) 0 1_P I02 I01 1_D (60) Demand B2 R2 (Regular prod.) O2 (Regular prod.) 2_P 2_D (80) Demand B3 I03 R3 (Regular prod.) O3 (Regular prod.) 3_P 3_D (140) Demand Same solution as in part a. 7