Problema 1. x 2. 4 Optimal Solution. x 1 = 3, x 2 = 1.5 (3,1.5) x 1 (0,0) (4,0) Optimal Solution x 1 = 0, x 2 = 3. Value of Objective Function = 18



Similar documents
IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2

Linear Programming Sensitivity Analysis

4.6 Linear Programming duality

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

Linear Programming Notes VII Sensitivity Analysis

3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

Why Choose Go4Hosting Data Center?

Solving Linear Programs using Microsoft EXCEL Solver

Linear Programming. Solving LP Models Using MS Excel, 18

Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

Chapter 6: Sensitivity Analysis

Sensitivity Analysis with Excel

Issues in Information Systems Volume 14, Issue 2, pp , 2013

Tutorial: Using Excel for Linear Optimization Problems

Chapter 2 Solving Linear Programs

Linear Programming Supplement E

3.1 Solving Systems Using Tables and Graphs

SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION

Sensitivity Report in Excel

Solving Linear Programs

5 Systems of Equations

CHAPTER 7: FACTORING POLYNOMIALS

Proximal mapping via network optimization

OPRE 6201 : 2. Simplex Method

Focus on minimizing costs EOQ Linear Programming. Two types of inventory costs (IC): Order/Setup Costs (OCs), and Carrying Costs (CCs) IC = OC + CC

Inteligencia Artificial Representación del conocimiento a través de restricciones (continuación)

Solution Key Average = Range 9 to 25. BOSTON COLLEGE GRADUATE SCHOOL OF MANAGEMENT Operations and Strategic Management Department

Using EXCEL Solver October, 2000

Curso Física Básica Experimental I Cuestiones Tema IV. Trabajo y energía.

Duality in General Programs. Ryan Tibshirani Convex Optimization /36-725

Linear programming. Learning objectives. Theory in action

Tilt switches N3 / N4... MEMS technology, one or two axis. Use. Options. + long lifetime and highly reliability due to mechanism-free MEMS technology

What is Linear Programming?

Lesson one. Proportions in the Port of Long Beach 1. Terminal Objective. Lesson 1

Unit 5. Landmarks and Large Numbers. How Much Is 1,000? Common Core

56:171 Operations Research Midterm Exam Solutions Fall 2001

Linear Programming Notes V Problem Transformations

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

The efficiency of fleets in Serbian distribution centres

Héctor Vargas P.O. Box 2808 Calexico, CA Phone: ( ) Cell: ( )

CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

Costing a Product by Old and New Techniques: Different Wines for Different Occasions

240ST Operations Management in the Supply Chain

Special Situations in the Simplex Algorithm

Chapter 5. Linear Inequalities and Linear Programming. Linear Programming in Two Dimensions: A Geometric Approach

Potential to Emit A Guide for Small Businesses

Linear Programming I

Module1. x y 800.

KB 2 Business Management Accounting Suggested Answers and Marking Guide

Vert-X 16-5V / % Ub. Applications Servodrives Dancer arm Operating table

Dynamode External USB3.0 Dual RAID Encloure. User Manual.

9.4 THE SIMPLEX METHOD: MINIMIZATION

Principles of demand management Airline yield management Determining the booking limits. » A simple problem» Stochastic gradients for general problems

SENSORS. Fiber Optic Sensors - S70. Advanced fiber optic amplifiers for high speed and low contrast applications

Stock Capture Features Guide

Chapter 5. Process design

APP Aircraft Performance Program Demo Notes Using Cessna 172 as an Example

Nonlinear Programming Methods.S2 Quadratic Programming

PCI Express 2.0 SATA III RAID Controller Card with Internal Mini-SAS SFF-8087 Connector

Getting Started with CashierPRO Inventory Management

( ) = ( ) = {,,, } β ( ), < 1 ( ) + ( ) = ( ) + ( )

Cursos Generales Complementarios. Universidad del TURABO. Escuela: Ingeniería Grado: Bachillerato

InstaPATCH Cu Cabling Solutions for Data Centers

ELECTROMAGNETIC DISC BRAKES

Basic furniture making Operations Stock Control Technical Documentation Wood and By-products Machining

User Guide HD-WLU3R1 DriveStation Duo

A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse

Discrete Optimization

OR topics in MRP-II. Mads Jepsens. OR topics in MRP-II p.1/25

Images of Microsoft Excel dialog boxes Microsoft. All rights reserved. This content is excluded from our Creative Commons license.

Lost Sales Tracking. MaddenCo Inc. Revised October, Copyright 2015 by MaddenCo, Inc All rights reserved.

Título del curso Créditos Pre-requisitos

Real Time Scheduling Basic Concepts. Radek Pelánek

LACQUERED HDF RAW HDF. Kronospan-MOFA Hungary Kft. has become one of the biggest and most modern producers of thin boards of Europe today.

Pavement Management Systems

Modificación de los Gastos operativos y de administración en JPMorgan Investment Funds y JPMorgan Funds

X12 Implementation. Guidelines. For. Transfer Version (996o)

Chapter 7. Production, Capacity and Material Planning

Financial Projections. Making sense of the money

36106 Managerial Decision Modeling Revenue Management

Optimization Modeling for Mining Engineers

Sample Bill. Understanding Large Commercial Electric Bills. White Paper #22. Demand-Based Time of Use Electric Rates Have Some Unique Terms

APPLICATION FOR AN ELECTRICITY CONNECTION (PROJECTS)

How Constraint Management fits the Operations Management Philosophy

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

Support Vector Machine (SVM)

Study Guide 2 Solutions MATH 111

Residential HVAC Load Sizing Training October 14, David Kaiser Green Code Plan Reviewer

Assembled in Florida, USA.

SOHOline and SOHO Slimline The SOHOline and SOHO Slimline offer a modular, sturdy and compact design

Convex Programming Tools for Disjunctive Programs

Resource Dedication Problem in a Multi-Project Environment*

Transcription:

Problema 1 12. a. 6 x 2 5 4 Optimal Solution 3 2 x 1 = 3, x 2 = 1.5 Value of Objective Function = 13.5 (3,1.5) 1 (0,0) 1 2 3 4 5 6 (4,0) x 1 3 2 x 2 Optimal Solution x 1 = 0, x 2 = 3 Value of Objective Function = 18 1 (0,0) 1 2 3 4 5 6 7 8 9 10 x 1 c. There are four extreme points: (0,0), (4,0), (3,1,5), and (0,3). Problema 2 21. a. Let F = number of tons of fuel additive S = number of tons of solvent base Max 40F + 30S 2/5F + 1 /2 S 200 Material 1 1 /5 S 5 Material 2 3 /5 F + 3 /10 S 21 Material 3 F, S 0 S

. Modelos de Decisiones Tarea 1 x 2 70 60 Material 3 Tons of Solvent Base 50 40 30 Material 2 20 Optimal Solution (25,20) 10 Feasible Region Material 1 0 10 20 30 40 50 x 1 F Tons of Fuel Additive c. Material 2: 4 tons are used, 1 ton is unused. d. No redundant constraints. Problema 3 28. a. Let E = number of shares of Eastern Cable C = number of shares of ComSwitch Max 15E + 18C 40E + 25C 50,000 Maximum Investment 40E 15,000 Eastern Cable Minimum 25C 10,000 ComSwitch Minimum 25C 25,000 ComSwitch Maximum E, C 0 ver gráfica en la sig. página c. There are four extreme points: (375,400); (1000,400);(625,1000); (375,1000) d. Optimal solution is E = 625, C = 1000 Total return = $27,375

C 2000 Minimum Eastern Cable Number of Shares of ComSwitch 1500 1000 Maximum Comswitch Maximum Investment 500 Minimum Conswitch 0 500 1000 1500 Number of Shares of Eastern Cable E Problema 4 47. a. S x 2 70 60 Tons of Solvent Base 50 40 30 5 20 4 3 10 1 Feasible Region 0 10 20 30 40 50 2 Tons of Fuel Additive x F 1

Yes. New optimal solution is F = 18.75, S = 25. Value of the new optimal solution is 40(18.75) + 60(25) = 2250. c. An optimal solution occurs at extreme point 3, extreme point 4, and any point on the line segment joining these two points. This is the special case of alternative optimal solutions. For the manager attempting to implement the solution this means that the manager can select the specific solution that is most appropriate. Problema 5 48. a. S Tons of Solvent Base 40 30 20 10 Points satisfying material requirements Minimum S Points satisfying minimum production requirements Minimum F 0 10 20 30 40 50 F Tons of Fuel Additive There are no points satisfying both sets of constraints; thus there will be no feasible solution. Materials Minimum Tons Required for F = 30, S = 15 Tons Available Additional Tons Required Material 1 2/5(30) + 1/2(15) = 19.5 20 - Material 2 0(30) + 1/5(15) = 3 5 - Material 3 3/5(30) + 3/10(15) = 22.5 21 1.5 Thus RMC will need 1.5 additional tons of material 3. Problema 6 29. a. Let O1 = percentage of Oak cabinets assigned to cabinetmaker 1 O2 = percentage of Oak cabinets assigned to cabinetmaker 2 O3 = percentage of Oak cabinets assigned to cabinetmaker 3 C1 = percentage of Cherry cabinets assigned to cabinetmaker 1 C2 = percentage of Cherry cabinets assigned to cabinetmaker 2 C3 = percentage of Cherry cabinets assigned to cabinetmaker 3 Min 1800 O1 + 1764 O2 + 1650 O3 + 2160 C1 + 2016 C2 + 1925 C3 50 O1 + 60 C1 40 Hours avail. 1 42O2 + 48 C2 30 Hours avail. 2 30 O3 + 35 C3 35 Hours avail. 3 O1 + O2 + O3 = 1 Oak C1 + C2 + C3 = 1 Cherry O1, O2, O3, C1, C2, C3 0

Note: objective function coefficients are obtained by multiplying the hours required to complete all the oak or cherry cabinets times the corresponding cost per hour. For example, 1800 for O1 is the product of 50 and 36, 1764 for O2 is the product of 42 and 42 and so on. Cabinetmaker 1 Cabinetmaker 2 Cabinetmaker 3 Oak O1 = 0.271 O2 = 0.000 O3 = 0.729 Cherry C1 = 0.000 C2 = 0.625 C3 = 0.375 Total Cost = $3672.50 c. No, since cabinetmaker 1 has a slack of 26.458 hours. Alternatively, since the dual price for constraint 1 is 0, increasing the right hand side of constraint 1 will not change the value of the optimal solution. d. The dual price for constraint 2 is 1.750. The upper limit on the range of feasibility is 41.143. Therefore, each additional hour of time for cabinetmaker 2 will reduce total cost by $1.75 per hour, up to a maximum of 41.143 hours. e. The new objective function coefficients for O2 and C2 are 42(38) = 1596 and 48(38) = 1824, respectively. The optimal solution does not change but the total cost decreases to $3552.50. Problema 7 30. a. Let M 1 = units of component 1 manufactured M 2 = units of component 2 manufactured M 3 = units of component 3 manufactured P 1 = units of component 1 purchased P 2 = units of component 2 purchased P 3 = units of component 3 purchased Min 4.50 M 1 5.00M 2 2.75M 3 6.50P 1 8.80P 2 7.00P 3 2M 1 3M 2 4M 3 21,600 Production 1M 1 1.5M 2 3M 3 15,000 Assembly 1.5M 1 2M 2 5M 3 18,000 Testing/Packaging M 1 1P 1 = 6,000 Component 1 1M 2 1P 2 = 4,000 Component 2 1M 3 1P 3 = 3,500 Component 3 M 1, M 2, M 3, P 1, P 2, P 3 0 Source Component 1 Component 2 Component 3 Manufacture 2000 4000 1400 Purchase 4000 0 2100 Total Cost: $73,550 c. Since the slack is 0 in the production and the testing & packaging departments, these department are limiting Benson's manufacturing quantities. Dual prices information: Production $0.906/minute x 60 minutes = $54.36 per hour Testing/Packaging $0.125/minute x 60 minutes = $ 7.50 per hour

d. The dual price is -$7.969. this tells us that the value of the optimal solution will worsen (the cost will increase) by $7.969 for an additional unit of component 2. Note that although component 2 has a purchase cost per unit of $8.80, it would only cost Benson $7.969 to obtain an additional unit of component 2. Problema 8 20. Let x m = number of units produced in month m I m = increase in the total production level in month m D m = decrease in the total production level in month m s m = inventory level at the end of month m where m = 1 refers to March m = 2 refers to April m = 3 refers to May Min 1.25 I 1 + 1.25 I 2 + 1.25 I 3 + 1.00 D 1 + 1.00 D 2 + 1.00 D 3 Change in production level in March x 1-10,000 = I 1 - D 1 or x 1 - I 1 + D 1 = 10,000 Change in production level in April x 2 - x 1 = I 2 - D 2 or x 2 - x 1 - I 2 + D 2 = 0 Change in production level in May x 3 - x 2 = I 3 - D 3 or x 3 - x 2 - I 3 + D 3 = 0 Demand in March 2500 + x 1 - s 1 = 12,000 or x 1 - s 1 = 9,500 Demand in April s 1 + x 2 - s 2 = 8,000 Demand in May s 2 + x 3 = 15,000 Inventory capacity in March s 1 3,000 Inventory capacity in April s 2 3,000 Optimal Solution: Total cost of monthly production increases and decreases = $2,500 x 1 = 10,250 I 1 = 250 D 1 = 0 x 2 = 10,250 I 2 = 0 D 2 = 0 x 3 = 12,000 I 3 = 1750 D 3 = 0 s 1 = 750 s 2 = 3000 Problema 9 EZ Windows se resuelve de forma similar al problema anterior y a la aplicación sobre planeación de la producción vista en clase.