A bilevel programming approach to determining tax credits for biofuel production

被引:73
作者
Bard, JF [1 ]
Plummer, J
Sourie, JC
机构
[1] Univ Texas, Dept Mech Engn, Grad Program Operat Res, Austin, TX 78712 USA
[2] Univ Texas, Coll Business Adm, Dept Management Sci & Informat Syst, Austin, TX 78712 USA
[3] INRA, Ctr Grignon, Dept Econ & Sociol Rurales, F-78850 Thiverval Grignon, France
关键词
nonlinear bilevel programming; government regulation; subsidies; grid search algorithm; agriculture;
D O I
10.1016/S0377-2217(98)00373-7
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents a bilevel programming formulation of a leader-follower game that can be used to help decision makers arrive at a rational policy for encouraging biofuel production. Zn the model, the government is the leader and would like to minimize the annual tax credits it allows the petro-chemical industry for producing biofuels. The crops grown for this purpose are on land now set aside and subsidized through a different support program. The agricultural sector is the follower. Its objective is to maximize profits by selecting the best mix of crops to grow as well as the percentage of land to set aside. Two solution algorithms are developed. The first involves a grid search over the tax credit variables corresponding to the two biofuels under consideration, ester and ethanol. Once these values are fixed, nonfood crop prices can be determined and the farm sector linear program solved. The second algorithm is based on an approximate nonlinear programming (NLP) formulation of the bilevel program. An "engineering" approach is taken where the discontinuities in the government's problem are ignored and the farm model is treated as a function that maps nonfood crop prices into allocation decisions. Results are given for an agricultural region in the northern part of France comprising 393 farms. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:30 / 46
页数:17
相关论文
共 20 条
[1]  
AIYOSHI E, 1981, IEEE T SYST MAN CYB, V11, P444
[2]  
ANANDALINGAM G, 1992, ANN OPERATIONS RES, V34
[3]   A SEPARABLE PROGRAMMING APPROACH TO THE LINEAR COMPLEMENTARITY-PROBLEM [J].
BARD, JF ;
FALK, JE .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (02) :153-159
[4]   CONVEX 2-LEVEL OPTIMIZATION [J].
BARD, JF .
MATHEMATICAL PROGRAMMING, 1988, 40 (01) :15-27
[5]   A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
MOORE, JT .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02) :281-292
[6]  
BARD JF, 1999, PRACTICAL BILEVEL PR
[7]   2-LEVEL LINEAR-PROGRAMMING [J].
BIALAS, WF ;
KARWAN, MH .
MANAGEMENT SCIENCE, 1984, 30 (08) :1004-1020
[8]  
Brooke A, 1992, GAMS: a user's guide
[9]  
DEMPE S, 1998, COMMUNICATION
[10]   ALGORITHMS FOR NONLINEAR BILEVEL MATHEMATICAL PROGRAMS [J].
EDMUNDS, TA ;
BARD, JF .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (01) :83-89