决策论c++代码（国外英文资料）.docVIP

决策论c++代码（国外英文资料） # include iostream # include cstdlib Using namespace STD. Int cn; Double maxemv; The class Strategy { [100] the number of the [100], the [100], [100], [100], [100], [100], [100], [100], [100] Public: The double sail [100], double makeprice, double sail price, double loss. / / peer-to-peer may be initialized The double sail [100], double, sailprice, double loss, double p [100]. / / initialize the risk Void BNF (); / / income matrix Void OPT (); / / pessimistic Void PES (); / / optimistic Void EQL (); / / may Void MCLARR (); / / loss matrix Void MCL (); / / minimum opportunity loss Void EMV (); / / the maximum expected value decision Void EOL (); / / minimum opportunity loss Void EVPI (); / / the value of information Void print1 (); Void print2 (); }; Strategy: Strategy: Strategy [100], double sail [100], double makeprice, double sailprice, double loss. { Int I, j; For (I = 0; I cn; I + +) Make [I]. For (j = 0, j cn; j + +) Sail [j] = Sail [j]; Makeprice = Makeprice; Sailprice = Sailprice; Loss = Loss; } Strategy: Strategy [100], double sail [100], double make price, double sailprice, double loss, double p [100] { Int I, j, k; For (I = 0; I cn; I + +) Make [I]. For (j = 0, j cn; j + +) Sail [j] = Sail [j]; Makeprice = Makeprice; Sailprice = Sailprice; Loss = Loss; For (k = 0; k cn; k + +) P [k] = P [k]; } Void Strategy: : BNF () { Int I, j; Double price. For (I = 0; I cn; I + +) For (j = 0, j cn; j + +) { If (Make [I] = Sail [j]) { [j] [j] [j] [j] [j] [j]. Price = Benefit [j]; } The else { [j]. } } Cout For (I = 0; I cn; I + +) { For (j = 0, j cn; j + +) { The cout \ t } Cout endl; } } Void Strategy: : OPT () { Int I, j, k, flag; / / flag record Double min [100], Max; For (I = 0; I cn; I + +) { (2). For (j = 0, j cn; j + +) { If (Benefit [I] [j] min [I]) { [I] [j]. } } } Max = min [0]; Flag = 0; For (k = 0; K 100; K++) { If (Max min [k]) { Max = min