运筹学 Operations Research 3.0-1规划(0-1 programming):x=01,j=1,2,…,n maX Z=C x (BIP): s.t. Ax=b 2021/2/20 32021/2/20 3 运 筹 学 Operations Research 3.0-1规划(0-1 programming): x j = 0,1, j = 1,2, ,n = = = = x j n st Ax b z c x BIP j T 0,1, 1,2, , . . max ( ) :