Linear Programing Problem

Slides:



Advertisements
Similar presentations
Applications of Optimization To Operations Management
Advertisements

Optimization problems using excel solver
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Pertemuan 2 – Menyelesaikan Formulasi Model Dengan Metode Grafik Riset Operasiomal- dewiyani 1.
Lesson 08 Linear Programming
Linear Programming We are to learn two topics today: LP formulation
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Question:- A company assembles four products (1, 2, 3, 4) from delivered components. The profit per unit for each product (1, 2, 3, 4) is £10, £15, £22.
Planning with Linear Programming
Linear Programming Problem
Linear Programming Models & Case Studies
Session II – Introduction to Linear Programming
1 Lecture 3 MGMT 650 Sensitivity Analysis in LP Chapter 3.
Operations Management Linear Programming Module B - Part 2
B-1 Operations Management Linear Programming Module B - New Formulations.
BA 555 Practical Business Analysis
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
Strategic Allocation of Resources
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
Pet Food Company A pet food company wants to find the optimal mix of ingredients, which will minimize the cost of a batch of food, subject to constraints.
B-1 Operations Management Linear Programming Module B - Harder Formulations.
B-1 Operations Management Linear Programming Module B.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming Applications
Chapter 10. Resource Allocation
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Linear Programming Modeling
1 Chapter 8 Linear programming is used to allocate resources, plan production, schedule workers, plan investment portfolios and formulate marketing (and.
Product Mix Problem Monet company makes four types of frames.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: Applications Chapter 4.
Ardavan Asef-Vaziri Systems and Operations Management
Decision Making via Linear Programming: A simple introduction Fred Phillips
1 1 Slide Integer Linear Programming Professor Ahmadi.
1 1 Slide Integer Linear Programming Professor Ahmadi.
1 OM2, Supplementary Ch. C Modeling Using Linear Programming ©2010 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Lecture 2 Chapter 10 continued…. Last Lecture Summary: Covered Sec and most part of Sec Basic concepts of Linear Programming Problem and.
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
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.
Team 9 Jin woo Choi Philip Liu Nallely Tagle
1/24: Linear Programming & Sensitivity Analysis Review: –LP Requirements –Graphical solutions Using MS Excel for Linear Programming Sensitivity Analysis.
Chapter 24 – Multicriteria Capital Budgeting and Linear Programming u Linear programming is a mathematical procedure, usually carried out by computer software,
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
MANGT 521 (B): Quantitative Management
DISTRIBUTION AND NETWORK MODELS (1/2)
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Business Mathematics MTH-367 Lecture 13. Chapter 10 Linear Programming An Introduction Continued…
Linear Programming –Strategic Allocation of Resources Decision Making with Excel Simulation 1.
Lecture 6 Excess Notation. Excess 8 notation indicates that the value for zero is the bit pattern for 8, that is 1000 Excess 8 notation indicates that.
Integer Programming Definition of Integer Programming If requiring integer values is the only way in which a problem deviates from.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
Rough-Cut Capacity Planning in SCM Theories & Concepts
1 Introduction To Linear Programming l Today many of the resources needed as inputs to operations are in limited supply. l Operations managers must understand.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
Rough-Cut Capacity Planning in SCM Theories & Concepts
Presentation by Team 2.
Objective Vocabulary Solve linear programming problems.
Module B Linear Programming.
LINGO LAB 3/4.
Introduction to Linear Programming
Applied Statistical and Optimization Models
Presentation transcript:

Linear Programing Problem 12/3/2015

Binary Programing

Question 1 A professor has been contacted by four not-for-profit agencies that are willing to work with student consulting teams. The agencies need help with such things as budgeting, information systems, coordinating volunteers, and forecasting. Although each of the four student teams could work with any of the agencies, the professor feels that there is a difference in the amount of time it would take each group to solve each problem. The professor's estimate of the time, in days, is given in the table below Teams Budgeting Information Volunteers Forecasting A 32 35 15 27 B 38 40 18 C 41 42 25 D 45 30 1, Define the linear programing model with its decision variables and its constraints. 2 Use the computer solution generated by Excel (Solve) to see which team works with which project

Product Mix

Question 2 Chemco produces a chemical mixture for a specific customer in 1000 pound batches. The mixture contains three ingrediants zinc, mercury, and potassium. The mixture must conform to formula specifications that are supplied by the customer. The company wants to know the amount of each ingredient it needs to put in the mixture that will meet all the requirements of the mix and minimize total cost. The mixture must contain at least 200 pounds of mercury, 300 pounds of a zinc, 100 pounds of potassium, and the ratio of potassium to the other two ingredients cannot exceed 1 to 4. The cost per pound of mercury is 400; the cost per pound of zinc, 180, and the cost per pound of potassium, 90. Formulate a linear programming model and solve by using a computer.

selection

Question 3 M. Quinn is preparing for a 12 day dog sled race. He owns eight dogs, but the race will allow only five dogs – the four pack dogs and the lead dog. M. Quinn has developed a test to measure the endurance of each dog. The endurance score for each dog and the amount of ALPO each dog requires per day is listed in the table below. M. Quinn wants to select the five dogs that will give the team the maximum endurance score subject to the following constraints.   Only 62 ounces of ALPO will be available each day. At least two of the five dogs selected must have lead dog ability Ren and Snippy are very close. Thus if Ren is selected for the team, Snippy must also be selected for the team and vice versa. Snoopy and Snert hate each others guts. Therefore, either Snoopy can be on the team, Snert can be on the team, or neither of them can be on the team. However, both of them can not be on the team. Formulate the integer LP problem to determine which dogs should be selected in order to maximize endurance rating. Dog Endurance rating Ounces of Alpo/day Lead dog ability Bolivar 50 12 Yes Pluto 90 11 No Ren 65 10 No Lassie 95 15 Yes Odie 60 8 No Snippy 65 11 No Snoopy 90 15 Yes Snert 80 18 No Which dogs should not be included on the team? __________ What is the total maximum endurance for the team? ________ How many ounces of ALPO will actually be needed each day? _________

Vendor

Question 4 A store purchases two products (Product 1 and Product 2) that it stocks from three different vendors (Vendor A, Vendor B and Vendor C). The suppliers have limited capacity, and no one supplier can meet all of demand of Acme Mexico City. In addition, the vendors charge different prices for the products as shown in the table below: Vendor's Price Product A B C 1 $12 $13 $14 2 $10 $11 $10 Each vendor has a limited capacity in terms of the total number of products it can supply. However, as long the store provides sufficiently advanced orders, each supplier can devote its capacity to product 1, product 2, or any combination of the two products, if the total number of units ordered is within its capacity. Vendor capacities are as follows. Vendor A B C Capacity 600 1000 800 The demand at the store is 1000 units of product 1 and 800 units of product 2 . The purchasing manager wants to determine an optimal - ie, a lowest-cost - buying plan that would determine how many (>= 0) of each product should be bought from each vendor. To help the purchasing manager: 1) Develop an LP model for the above problem.