EXPLORATION OF VARIOUS GOAL PROGRAMMING FORMULATIONS - WITH APPLICATION TO ADVERTISING MEDIA SCHEDULING

被引:16
作者
DEKLUYVER, CA
机构
[1] University of Canterbury, Christchurch
关键词
D O I
10.1057/jors.1979.30
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This article examines various goal programming formulations, including the well-known MINSUM and MINMAX models, and their extensions to include explicit recognition of “soft” constraints. The differences in the nature of the solution sets and their sensitivity are illustrated using a real-life advertising media scheduling problem involving 63 media options. It is concluded that MINMAX models may often be more useful in gaining insight into the nature of the problem’s solution, and that both MINSUM and MINMAX models may be considerably enriched through the use of soft constraints. © Operational Research Society Ltd.
引用
收藏
页码:167 / 171
页数:5
相关论文
共 8 条
[1]   EXPLORATION OF LINEAR PROGRAMMING IN MEDIA SELECTION [J].
BASS, FM ;
LONSDALE, RT .
JOURNAL OF MARKETING RESEARCH, 1966, 3 (02) :179-188
[2]   OPTIMAL ESTIMATION OF EXECUTIVE COMPENSATION BY LINEAR PROGRAMMING [J].
Charnes, A. ;
Cooper, W. W. ;
Ferguson, R. O. .
MANAGEMENT SCIENCE, 1955, 1 (02) :138-151
[3]  
CHARNES A, 1975, 381 CARN MELL U MGMT
[4]  
DEKLUYVER CA, 1978, J ADVERTISING RES, V18, P27
[5]  
IJIRY Y, 1965, MANAGEMENT GOALS ACC
[6]   HARD AND SOFT CONSTRAINTS IN LINEAR-PROGRAMMING [J].
KENDALL, JW .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1975, 3 (06) :709-715
[7]  
KORNBLUTH J, 1973, OMEGA, V1, P191
[8]  
WIDHELM WB, 1976, EXTENSIONS UNIFICATI