Graduate Program in Business Information Systems Integer and Goal Programming Aslı Sencer.

Slides:



Advertisements
Similar presentations
Computational Methods for Management and Economics Carla Gomes Module 2 (addendum) Revisiting the Divisibility Assumption (Textbook – Hillier and Lieberman)
Advertisements

Thank you and welcome Linear Programming (LP) Modeling Application in manufacturing And marketing By M. Dadfar, PhD.
Optimization problems using excel solver
1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
Introduction to Mathematical Programming
Lesson 08 Linear Programming
1 Chapter 11 Here we see cases where the basic LP model can not be used.
Pure, Mixed-Integer, Zero-One Models
Linear Programming Problem
Lesson 11 Multicriteria Decisions within LP Framework.
1 1 Slide © 2005 Thomson/South-Western Lesson 10 Multicriteria Decisions within LP Framework n Goal Programming n Goal Programming: Formulation and Graphical.
Chapter 5 Linear Inequalities and Linear Programming
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Operations Management Linear Programming Module B - Part 2
Goal Programming How do you find optimal solutions to the following?
Introduction to Linear and Integer Programming
Introduction to Management Science
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.
QM B Linear Programming
Linear Programming Integer Linear Models. When Variables Have To Be Integers Example – one time production decisions –Fractional values make no sense.
Linear Goal Programming
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
Introduction to Management Science
LINEAR PROGRAMMING AND APPLICATIONS Graduate Program in Business Information Systems Aslı Sencer.
Introduction to Management Science
INTRODUCTION TO LINEAR PROGRAMMING
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
LP formulation of Economic Dispatch
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Linear Programming Models: Graphical and Computer Methods
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Graduate Program in Business Information Systems Linear Programming: Sensitivity Analysis and Duality Aslı Sencer.
Multicriteria Decision Making
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
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.
Chapter 9 - Multicriteria Decision Making 1 Chapter 9 Multicriteria Decision Making Introduction to Management Science 8th Edition by Bernard W. Taylor.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
Team 9 Jin woo Choi Philip Liu Nallely Tagle
MIS 463: Decision Support Systems for Business Review of Linear Programming and Applications Aslı Sencer.
1 Chapter 11 A number of important scheduling problems... require the study of an astronomical number of arrangements to determine which one is best....
Linear Programming with Excel Solver.  Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 11-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
MGTSC 352 Lecture 14: Aggregate Planning WestPlast Case H ow to deal with multiple objectives How to use binary variables AltaMetal Case Aggregating into.
Table of Contents CD Chapter 17 (Goal Programming)
Arben Asllani University of Tennessee at Chattanooga Chapter 5 Business Analytics with Goal Programming Business Analytics with Management Science Models.
Log Truck Scheduling Problem
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
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
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Chapter 6 Integer, Goal, and Nonlinear Programming Models © 2007 Pearson Education.
Nonlinear Programming Prepared by Lee Revere and John Large
Chapter 5 Linear Inequalities and Linear Programming
Goal programming.
Integer Linear Programming
Goal Programming How do you find optimal solutions to the following?
Linear Programming Applications in Services
Linear Programming Integer Linear Models.
Chapter 1. Formulations.
Spreadsheet Modeling & Decision Analysis:
Presentation transcript:

Graduate Program in Business Information Systems Integer and Goal Programming Aslı Sencer

BIS 517-Aslı Sencer2 Integer Program Structurally like the LP models where the solutions must be integers! Ex: Production order quantities Number of items sent from plants to warehouses Binary decisions produce or do not produce Assign staff i to job j or not Locate facility i in location j or not

BIS 517-Aslı Sencer3 Ex:Redwood Furniture Model (revisited) Optimal solution:

BIS 517-Aslı Sencer4 The Branch and Bound Method An effective search procedure that involves solving a succession of carefully formulated LP’s. If the optimal solution of the parent program includes fractions, then two descendent LP’s are developed and solved to force the noninteger variable to be an integer. The optimal objective function of the parent program constitues a bound on the optimal objective function value of the descendent LP’s.

BIS 517-Aslı Sencer5 Graphical Solution Problem1 Problem XtXt XcXc 45 Problem 3

BIS 517-Aslı Sencer 6 Branch and Bound Solution Problem 1 Xt=4.2 Xc=9.2 P=98.8 Problem 2 Xt=4 Xc=9.3 P=98.4 Problem 3 Xt=5 Xc=8 P=94 Problem 4 Xt=4 Xc=9 P=96 Problem 5 Xt=2.6 Xc=10 P=95.6 OPTIMAL SOLUTION

BIS 517-Aslı Sencer7 When do we round off the LP? For problems having small number of variables, IP is solved in a short time. Bigger problems require a lot of time. If no integer solution has been found, a rounded LP may be used. Which solution to be used is judgemental.

BIS 517-Aslı Sencer8 Solving Integer Programs with a Spreadsheet When using Excel Spreadsheet, it is sufficient to add a new constraint and define the decision variables as integers. You can also use WinQSB or QuickQuant to solve LP and IP problems.

BIS 517-Aslı Sencer9 Ex: Maui Miser Car Rentals Budget $500,000. Three types of cars: Economy vans, compact cars, large cars Income/vehicle: $15,000, $7,600, $10,600 Costs/vehicle: $25,000, $15,000, $21,000 At least 25 vehicles At least 5 vans, at least 5 large cars, at least 12 passenger cars # large cars can not exceed the #compacts Average daily rental rate should be less than $39 where Daily rental prices/vehicle: $50, $30, $40

BIS 517-Aslı Sencer10 Ex: Formulation

BIS 517-Aslı Sencer11 Optimal Solution

BIS 517-Aslı Sencer12 Goal Programming Maximize profit OR Minimize cost Single Goal Sometimes we have Multiple Goals. Minimize Cost AND Maximize Customer Satisfaction Maximize Return AND Minimize Risk What is the optimal balance in attaining the conflicting goals?

BIS 517-Aslı Sencer13 Basic Idea It is impossible to meet all goals simultaneously. The focus aims at achieving certain targets for each goal. The overall objective is to find the solution that collectively minimizes deviations from these targets.

BIS 517-Aslı Sencer14 Ex:Goal Programming in Redwood Furniture Co. Objectives Maximize Profit Maximize Revenue to maintain marketshare growth Maximize training time to increase work-force productivity TableChair Profit/unit$6$8 Revenue/unit$50$25 Train. time/unit1hr.3hr. Each LP has a different optimal solution. An idea is to set targets for the goals. Target $90 $450 30hr.

BIS 517-Aslı Sencer15 LP with Goal Targets Warning: When these constraints are added to the Redwood Product Mix Formulation there may be no feasible solution satisfying the minimum requirements of all goals! What should we do then? Any comments? Answer: Try to lower the targets Idea 1: We can treat targets as the lower bounds on the goals

BIS 517-Aslı Sencer16 Goal Deviations Idea 2: We can allow some goals to be partially met! Compared to LP, goal programming is flexible. Optimal balance between goals can be achieved in several ways. Goal Deviation: Amount of deviation from the goal target is a variable to be minimized.

BIS 517-Aslı Sencer17 Defining Goal Deviations Y p : The amount by which profit deviates from the target level When Yp is positive, When Yp is negative

BIS 517-Aslı Sencer18 Goal Deviation Constraints Regular Constrains:

BIS 517-Aslı Sencer19 Goal Programming Objective It costs $1 to fall a dollar below the profit target. However exceeding the profit target is desirable. Falling below revenue target lowers market share, lost earnings is $2 for a dollar below revenue target. Training time upto 30hrs enhances future efficiency. It costs $0.50 per hour obtained. Beyond 30hrs. training effect is negligable.

BIS 517-Aslı Sencer20 Ex: Optimal Solution Profit and Training levels are $6 and 6hrs. below their targets. Revenue target is met.

BIS 517-Aslı Sencer21 Ex: Maui Miser Case (revisited) Achieve annual rental income of at least $300,000 from fleet addition Spend as close to as possible to $500,000 Do not exceed average daily rental of $39 for the vehicles in the fleet addition. Penalty Costs: $1 for each dollar violation of goals 1 and 2. $10,000 for each dollar violation of goal 3.

BIS 517-Aslı Sencer22 Ex: Maui Miser Case GP Formulation

BIS 517-Aslı Sencer23 Ex: Maui Miser Case GP Optimal Solution