minimize TOTALCOST sumi in 1 N j in

直感的なモデル記述 minimize TOTAL_COST: sum{i in 1. . N, j in 1. . M}C[i, j]*x[i, j] +sum{j in 1. . M}F[j]*y[j]; subject to DEMAND{i in 1. . N}: sum{j in 1. . M}x[i, ｊ]>=D[i]; subject to CAPACITY{j in 1. . M}: sum{i in 1. . N}x[i, j]<=L[j]; subject to LOGIC{i in 1. . N, j in 1. . M}: x[i, j]<=M*y[j]; 2

モデルファイル(FLP. mod)を読む param N; param M; param C{i in 1. . N, j in 1. . M}; param F{j in 1. . M}; param D{i in 1. . N}; param L{j in 1. . M}; var x{i in 1. . N, j in 1. . M} >= 0; var y{j in 1. . M} integer in 0. . 1; 記号の定義 パラメータ（定数）を指定 決定変数を指定 （xは非負，yはバイナリ） minimize TOTAL_COST: Sum{i in 1. . N, j in 1. . M}C[i, j]*x[i, j]+sum{j in 1. . M}F[j]*y[j]; subject to DEMAND{i in 1. . M}: Sum{j in 1. . N}x[i, j]>=D[i]; subject to CAPACITY{j in 1. . M}: Sum{i in 1. . N}x[i, j]<=L[j]; subject to LOGIC{i in 1. . N, j in 1. . M}: x[i, j]<=M*y[j]; モデルの記述 5

スクリプトファイル(FLP. run)を読む model FLP. mod; data FLP. dat; option solver CPLEX; problem FLP: x, y, TOTAL_COST, DEMAND, CAPACITY, LOGIC; solve FLP; display x; display y; display FLP > FLP. sol; display x > FLP. sol; display y > FLP. sol; 変数はxとy 目的関数は「TOTAL」 制約式は「DEMAND…」 解の表示，書き込み 6