A bilevel programming approach to determining tax credits for biofuel production

作者: Jonathan F. Bard , John Plummer , Jean Claude Sourie

DOI: 10.1016/S0377-2217(98)00373-7

关键词:

摘要: Abstract This paper presents a bilevel programming formulation of leader–follower game that can be used to help decision makers arrive at rational policy for encouraging biofuel production. In the model, government is leader and would like minimize annual tax credits it allows petro-chemical industry producing biofuels. The crops grown this purpose are on land now set aside subsidized through different support program. agricultural sector follower. Its objective maximize profits by selecting best mix grow as well percentage aside. Two solution algorithms developed. first involves grid search over credit variables corresponding two biofuels under consideration, ester ethanol. Once these values fixed, nonfood crop prices determined farm linear program solved. second algorithm based an approximate nonlinear (NLP) An “engineering” approach taken where discontinuities in government's problem ignored model treated function maps into allocation decisions. Results given region northern part France comprising 393 farms.

参考文章(16)
HIERARCHICAL DECENTRALIZED SYSTEMS AND ITS NEW SOLUTION BY A BARRIER METHOD. IEEE Transactions on Systems, Man, and Cybernetics. ,vol. 11, pp. 444- 449 ,(1981) , 10.1109/TSMC.1981.4308712
Jonathan F. Bard, 清孝 志水, 陽 石塚, Nondifferentiable and Two-Level Mathematical Programming ,(1996)
Y. Fan, S. Sarkar, L. Lasdon, Experiments with successive quadratic programming algorithms Journal of Optimization Theory and Applications. ,vol. 56, pp. 359- 383 ,(1988) , 10.1007/BF00939549
Jonathan F. Bard, Convex two-level optimization Mathematical Programming. ,vol. 40, pp. 15- 27 ,(1988) , 10.1007/BF01580720
Jonathan F. Bard, James E. Falk, A separable programming approach to the linear complementarity problem Computers & Operations Research. ,vol. 9, pp. 153- 159 ,(1982) , 10.1016/0305-0548(82)90014-4
J. J. Júdice, A. M. Faustino, A sequential LCP method for bilevel linear programming Annals of Operations Research. ,vol. 34, pp. 89- 106 ,(1992) , 10.1007/BF02098174
Jonathan F. Bard, James T. Moore, A Branch and Bound Algorithm for the Bilevel Programming Problem Siam Journal on Scientific and Statistical Computing. ,vol. 11, pp. 281- 292 ,(1990) , 10.1137/0911017
James E. Falk, Jiming Liu, On bilevel programming, part I: general nonlinear cases Mathematical Programming. ,vol. 70, pp. 47- 72 ,(1995) , 10.1007/BF01585928
José Fortuny-Amat, Bruce McCarl, A Representation and Economic Interpretation of a Two-Level Programming Problem Journal of the Operational Research Society. ,vol. 32, pp. 783- 792 ,(1981) , 10.1057/JORS.1981.156
B. Tolwinski, Closed-loop Stackelberg solution to a multistage linear-quadratic game Journal of Optimization Theory and Applications. ,vol. 34, pp. 485- 501 ,(1981) , 10.1007/BF00935889