Linear Goal Programming

Slides:



Advertisements
Similar presentations
2.7 Linear Programming.
Advertisements

1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
LINEAR PROGRAMMING (LP)
Introduction to Mathematical Programming
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Manufacturing Microwaves A company produces both small and large microwave ovens. Machine time: 4 hours for small ovens and 3 hours for large ones. A total.
Planning with Linear Programming
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.
Linear Programming Problem Formulation.
Operations Management Linear Programming Module B - Part 2
B-1 Operations Management Linear Programming Module B - New Formulations.
Goal Programming How do you find optimal solutions to the following?
Introduction to Management Science
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 6 LP Assumptions.
EMGT 501 HW # Due Day: Sep 14.
Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go.
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".
B-1 Operations Management Linear Programming Module B - Harder Formulations.
PRODUCTION PLANNING ELİF ERSOY Production Planning2 WHAT IS PRODUCTION PLANNING?  Production planning is a process used by manufacturing.
Linear Programming Applications
INTRODUCTION TO LINEAR PROGRAMMING
Graduate Program in Business Information Systems Integer and Goal Programming Aslı Sencer.
Introduction to Mathematical Programming OR/MA 504 Chapter 5 Integer Linear Programming.
Product Mix Problem Monet company makes four types of frames.
Decision Making via Linear Programming: A simple introduction Fred Phillips
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Product Mix & Master Production Scheduling
Production Management Application by Aparna Asha. v Saritha Jinto Antony Kurian.
Spreadsheet Modeling & Decision Analysis:
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.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 6-1 Integer Linear Programming Chapter 6.
Chapter 9 - Multicriteria Decision Making 1 Chapter 9 Multicriteria Decision Making Introduction to Management Science 8th Edition by Bernard W. Taylor.
1 Additional examples LP Let : X 1, X 2, X 3, ………, X n = decision variables Z = Objective function or linear function Requirement: Maximization of the.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Team 9 Jin woo Choi Philip Liu Nallely Tagle
Examples discussed in class
EMGT 501 Fall 2005 Midterm Exam Due Day: Oct 17 (Noon)
Linear Programming last topic of the semester What is linear programming (LP)? Not about computer programming “Programming” means “planning” “Linear” refers.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., GOAL PROGRAMMING 1. Opprettholde stabil profitt 2. Øke eller opprettholde gitte markedsandeler.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
DISTRIBUTION AND NETWORK MODELS (1/2)
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
Table of Contents CD Chapter 17 (Goal Programming)
HW # Due:
Arben Asllani University of Tennessee at Chattanooga Chapter 5 Business Analytics with Goal Programming Business Analytics with Management Science Models.
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.
Integer Programming Definition of Integer Programming If requiring integer values is the only way in which a problem deviates from.
LINEAR PROGRAMMING.
Copyright © Cengage Learning. All rights reserved. 3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
1 Geometrical solution of Linear Programming Model.
F2:Management Accounting. 2 Designed to give you knowledge and application of: Section F: Short–term decision–making techniques F1. Cost –Volume-Profit.
Linear Programming Applications
Goal, Weighted Goal, and Preemptive Programming Ivan G. Guardiola Ph.D.
Chapter 5 Linear Inequalities and Linear Programming
Linear Programming Dr. T. T. Kachwala.
Goal programming.
Chapter 8 Goal Programming.
Goal Programming How do you find optimal solutions to the following?
Case 2:( Model Construction):
Integer Linear Programming
Presentation transcript:

Linear Goal Programming

What is Goal Programming? Single objective in formulating LPs so far Max profit Min cost Several simultaneous objectives in practice Increase reliability Improve employee morale Improve company’s image Goal programming: a way of solving multi-objective problems

Categorization of Goal Programming Nonpreemptive goal programming Goals with roughly same importance Assign weights to goals Construct a single objective function to minimize the weighted sum of deviations from goals Preemptive goal programming Hierarchy of priority levels for goals 1st priority is to satisfy goal 1 2nd priority is to satisfy goal 2, etc. Solve sequentially

Three Possible Types of Goals A lower, one-sided goal a1 x1 + a2 x2 + … + an xn ≥ b example: profit exceeds some threshold An upper, one-sided goal a1 x1 + a2 x2 + … + an xn ≤ b example: cost less than some value A two-sided goal a1 x1 + a2 x2 + … + an xn = b example: production equal to forecasted demand

Dewright Company Example – Nonpreemptive Goal Programming The Dewright Company is considering three new products to replace current models that are being discontinued, so their OR department has been assigned the task of determining which mix of these products should be produced. Management wants primary consideration given to three factors: long-run profit, stability in the workforce, and the level of capital investment that would be required now for new equipment. In particular, management has established the goals of (1) achieving a long-run profit of at least $125 million from these products, (2) maintaining the current employment level of 4000 employees, and (3) holding the capital investment to less than $55 million. However, management realizes that it probably will not be possible to attain all these goals simultaneously, so it has discussed priorities with the OR department. This discussion has led to setting penalty weights of 5 for missing the profit goal (per $1 million under), 2 for going over the employment goal (per 100 employees), 4 for going under this same goal, and 3 for exceeding the capital investment goal (per $1 million over). Each new product’s contribution to profit, employment level, and capital investment level is proportional to the rate of production. These contributions per unit rate of production are shown in the following table, along with the goals and penalty weights.

Dewright Company Example (Cont’d) Unit Contribution Product Factor 1 2 3 Goal (Units) Penalty Weight Long-run profit 12 9 15 ≥ 125 (millions of dollars) 5 Employment level 4 = 40 (hundreds of employees) 2(+), 4(-) Capital investment 7 8 ≤ 55 (millions of dollars)

Dewright Company Example (Cont’d) Decision variables x1: production rate of product 1 x2: production rate of product 2 x3: production rate of product 3 Three goals Profit goal: 12 x1 + 9 x2 + 15 x3 ≥ 125 (lower one-sided goal) Employment goal: 5 x1 + 3 x2 + 4 x3 = 40 (two-sided goal) Investment goal: 5 x1 + 7 x2 + 8 x3 ≤ 55 (upper one-sided goal) Objective function: Min Z = 5(12 x1 + 9 x2 + 15 x3 – 125)- + 2(5 x1 + 3 x2 + 4 x3 – 40)+ + 4(5 x1 + 3 x2 + 4 x3 – 40)- + 3(5 x1 + 7 x2 + 8 x3 – 55)+ where x if x ≥ 0 0 if x > 0 x+ = x- = 0 if x < 0 - x = |x| if x ≤ 0

Dewright Company Example (Cont’d) To put into a proper LP form Let y1 = 12 x1 + 9 x2 + 15 x3 – 125 y2 = 5 x1 + 3 x2 + 4 x3 – 40 y3 = 5 x1 + 7 x2 + 8 x3 – 55 and y1 = y1+ - y1- and y1+ ≥ 0, y1- ≥ 0 y2 = y2+ - y2- and y2+ ≥ 0, y2- ≥ 0 y3 = y3+ - y3- and y3+ ≥ 0, y3- ≥ 0

Dewright Company Example (Cont’d) Final LP for nonpreemptive goal programming: Min Z = 5 y1- + 2 y2+ + 4 y2- + 3 y3+ subject to 12 x1 + 9 x2 + 15 x3 – (y1+ - y1- ) = 125 5 x1 + 3 x2 + 4 x3 – (y2+ - y2- ) = 40 5 x1 + 7 x2 + 8 x3 – (y3+ - y3- ) = 55 xi, yi+, yi- ≥ 0 i=1,2,3 add any other functional constraints too

Dewright Company Example (Cont’d) Optimal solution: x1 = 25/3 x2 = 0 x3 = 5/3 y1+ = y1- = 0 → y1 = 0 → 1st goal is satisfied y2+ = 25/3, y2- = 0 → y2 = 25/3 → 2nd goal exceeds employment level by 25/3 hundred employees y3+ = y3- = 0 → y3 = 0 → 3rd goal is satisfied

Modified Dewright Company Example - Preemptive Goal Programming Priority Level Factor Goal Penalty Weight 1st Priority Employment level ≤ 40 2M Capital investment ≤ 55 3M 2nd Priority Long-run profit ≥ 125 5 ≥ 40 4

Modified Dewright Company Example -Preemptive Goal Programming (Cont’d) 1st LP: Min Z = 2M y2+ + 3M y3+ subject to 5 x1 + 3 x2 + 4 x3 – (y2+ - y2- ) = 40 5 x1 + 7 x2 + 8 x3 – (y3+ - y3- ) = 55 xi ≥ 0 i=1,2,3, yi+, yi- ≥ 0 i=2,3 There are multiple optimal solutions with y2+ = 0 and y3+ = 0. To get 2nd LP, drop y2+, y3+ forcing those goals to remain satisfied, also add 2nd priority constraints

Modified Dewright Company Example -Preemptive Goal Programming (Cont’d) 2nd LP: Min Z = 5 y1- + 4 y2- subject to 12 x1 + 9 x2 + 15 x3 – (y1+ - y1- ) = 125 5 x1 + 3 x2 + 4 x3 + y2- = 40 5 x1 + 7 x2 + 8 x3 + y3- = 55 xi ≥ 0 i=1,2,3, y1+, y1-, y2-, y3- ≥ 0 There is a unique solution: x1 = 5, x2 = 0, x3 = 15/4, y1+ = 0, y1- = 35/4, y2- = 0 and y3- = 0.

Dewright Company Example: Compare the two solutions Solution by nonpreemptive goal programming: (x1, x2, x3 ) = (25/3, 0, 5/3) 12 x1 + 9 x2 + 15 x3 = 125 profit 5 x1 + 3 x2 + 4 x3 = 48.33 employment 5 x1 + 7 x2 + 8 x3 = 55 capital investment Solution by preemptive goal programming: (x1, x2, x3 ) = (5, 0, 15/4) 12 x1 + 9 x2 + 15 x3 = 116.25 profit 5 x1 + 3 x2 + 4 x3 = 40 employment

Camyo Manufacturing Example Camyo Manufacturing produces four parts that require the use of a lathe and a drill press. The two machines operate 10 hours a day. The following table provides the time in minutes required by each part: It is desired to balance the use of the two machines by requiring the difference between their total operation times not to exceed 30 minutes. The market demand limits the number of units produced of each part to at least 10 units. Additionally, the number of units of part 1 may not exceed that of part 2. Part Lathe Drill Press 1 5 3 2 6 4 7

Camyo Manufacturing Example (Cont’d) Decision variables xi = number of parts produced per day of type i, i=1, 2, 3, 4 Operation time goal: Difference between the time on machine 1 (lathe) and time on machine 2 (drill press) is not to exceed 30 minutes: |time1 – time2| ≤ 30 -30 ≤ time1 – time2 ≤ 30 time1 = 5 x1 + 6 x2 + 4 x3 + 7 x4 lathe time2 = 3 x1 + 2 x2 + 6 x3 + 4 x4 drill press -30 ≤ (5 x1 + 6 x2 + 4 x3 + 7 x4) – (3 x1 + 2 x2 + 6 x3 + 4 x4) ≤ 30 -30 ≤ 2 x1 + 4 x2 - 2 x3 + 3 x4 ≤ 30

Camyo Manufacturing Example (Cont’d) Final LP for nonpreemptive goal programming: Min Z = y1+ + y2- subject to 5 x1 + 6 x2 + 4 x3 + 7 x4 ≤ 600 lathe, 600 min in a day 3 x1 + 2 x2 + 6 x3 + 4 x4 ≤ 600 drill press, 600 min a day x1 ≥ 10 x2 ≥ 10 x3 ≥ 10 x4 ≥ 10 x1 - x2 ≤ 0 2 x1 + 4 x2 - 2 x3 + 3 x4 – (y1+ - y1-) = 30 time1 - time2 ≤ 30 2 x1 + 4 x2 - 2 x3 + 3 x4 – (y2+ - y2-) = -30 time1 - time2 ≥ -30 xi ≥ 0, i=1, 2, 3, 4 yi+ ≥ 0, yi- ≥ 0, i=1, 2 demand must exceed 10 units