Goal Programming Example 1 on Page 191 Show

Deviational Variables = amount exceeded ith goal = amount under ith goal Penalty cost:

Preemptive Goal Programming Order of importance is known: P 1>>P 2>>P 3 O. F.

Suncoast Office, Summary Problem a Goal Programming Problem Number of Contact Sales no. /

Suncoast Office, Formulation, a Goal Programming Problem S. T: O. F: Min Min IE

Suncoast Office, Sensitivity Analysis a Goal Programming Problem Priorities Second Highest Optimal Solution Lowest

Goal Programming Available Information mpi goals & no O. F. Formulation of Problem. Goal

Goal Programming Assume to know relative importance of goals Have an additive linear cost

Slides: 8

Download presentation

Goal Programming: Example 1 on Page 191 Show HIM LIP HIW Cost/min Football 7 M 10 M 5 M $100, 000 Soap Opera 3 M 5 M 4 M $60, 000 min min max 40 M 60 M 35 M $600, 000 O. F. S. t. HIM LIP HIW Budget IE 416, Chap 4, August 99 No feasible solution

Deviational Variables = amount exceeded ith goal = amount under ith goal Penalty cost: based on the order and magnitude of importance. O. F. S. t. HIM LIP HIW Budget IE 416, Chap 4, August 99 All Variables are nonnegative

Preemptive Goal Programming Order of importance is known: P 1>>P 2>>P 3 O. F. S. t. HIM LIP HIW Budget IE 416, Chap 4, August 99 All Variables are nonnegative

Suncoast Office, Summary Problem a Goal Programming Problem Number of Contact Sales no. / contact hr / cust. $ / cust. mon. Customer Previous New 200 120 2 3 250 125 X 1 X 2 * 4 contact agent * max 40 hr/ mon. overtime *at least * max 30 hr/ mon. under $70, 000/ mon. utilization From: An Introduction to Management Science By: Anderson, Sweeney, Williams IE 416, Chap 4, Sept. 2009

Suncoast Office, Formulation, a Goal Programming Problem S. T: O. F: Min Min IE 416, Chap 4, Sept 2009

Suncoast Office, Sensitivity Analysis a Goal Programming Problem Priorities Second Highest Optimal Solution Lowest X 1 X 2 Deviation Z 1 Z 2 Z 3 S 1+, S 2 - S 3 S 4 -, S 5 - 250 60 0 S 3 S 1+, S 2 - S 4 -, S 5 - 250 60 0 S 4 -, S 5 - S 1+, S 2 - S 3200 120 0 Based on solution on “Class Notes & Video” web page. IE 416, Chap 4, May ‘ 99 0 0 80 60 60 5000

Goal Programming Available Information mpi goals & no O. F. Formulation of Problem. Goal as. Coefficient of O. F. constraint zero mpi goals & penalty modified const. penalty with deviation var. mpi goals & order multi O. F. (ordered) IE 416, Chap 14: 1, July 98 P 1>>P 2. . .

Goal Programming Assume to know relative importance of goals Have an additive linear cost function Use LP Do not know precisely the relative importance of goals Have a rank order of goals Use preemptive goal programming (goal programming simplex) IE 416, Chap 14: 2, July 98