二层多随从线性规划的根基性质及算法.pdfVIP

Á ‡ 1952c§Von Stackerberg ÄgJ Ñ 5y.§¿Uk?n¢S©+ n ¯K ©?Ø ˜a3¢S¥äk2“L5õ‘l‚55y.3 å8š˜k.cJe?Ø Œ18AÛ5Ÿ§ Œ18å8eZ‡ ¡¿§Œ18f[ à8˜ ÐAÛ5Ÿ ¿|^‚55yéónØ?Ø õ‘l‚55y.§ ü^`z^‡ §|^©‰ Ñõ ‘l‚55y.AÛ5ŸÚ`z^‡ § ˜‡¦)T.Ž{§¿ÏL ê~©Û§y nØ(5ڎ{Œ15 ©©ÊÙ 1˜Ù0 õ5y )!uÐ9yG 1Ù0 ˜ 3© ¥¤I‡^Vg9(J1nÙ0 õ‘l‚55y.§¢S µ¶3å8š˜k.cJe§ïÄ Œ18AÛ5ŸÚõ‘l‚55y `z^‡§)ûda ¯KJø nØÄ: 1 oÙ·‚J Ñ )ûda ¯K Ž{ §¿?1 êŠ©Û 1ÊÙo( ©¤‰óŠ§¿é ±uÐJ Ñ g Cw{ …c: ‚55y ; éónØ ; `z^‡ ; õ‘l . I ABSTRACT A model of bilevel programming was introduced by Von Stackelberg in 1952 §and the bilevel linear programming can handle very availably actual decentralized manage- ment system . In this paper , a model of a linear bilevel programming problem with multiple followers(MFBLP) is proposed . Under the assumption that the constrained set is bounded and nonempty , we discussed the geometric properties of the feasible set for MFBLP model and optimality conditions of MFBLP . And we proved that the feasible set is composed of the union of the faces of the constrained set and is a weak quasi-convex set , and we obtained two sufficient and necessary conditions about the optimality condition of MFBLP problem by duality theory . Finally , we design a finer algorithms for the MFBLP problem by using these geometric properties and optimality conditions of MFBLP in this paper . By analyzing example , we know that the theory and algorithm is legitimacy . This paper is divided into 5 sections . The first chapter contains the history , development and actuality of multilevel programming . In section 2 , we introduce some concepts and results which we’ll use in the sequel . In section 3 , we introduce a model of MFBLP and some backgrounds . With the assumption that