//go to: https://www.lutanho.net/goodies/codetester.html //click on: (*)javascript //copy & paste: this text //adapt: T, sigma, a, b, K, C values //click on: [run] //Instance generator for //"A new dynamic programming algorithm for the //single item capacitated dynamic lot size model" //by Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee (1994) //Journal of Global Optimization 4(3):285-300 var sigma, a, b, T=96; //24,48,96,192,384 var h=1, p=0, K=900; //100,900,3600 var C=1200; //250,700,1200 //demand: d=200+sigma*z+a*sin((t+b/4)*2*pi/b) //1: sigma=67; a=0; b=T; //2: sigma=237; a=0; b=T; //3: sigma=67; a=125; b=T; //4: sigma=67; a=125; b=12; sigma=67; a=125; b=T; function demand(t) { var dd=Math.round(200+sigma*z()+a*Math.sin((t+b/4)*2*Math.PI/b)); if (dd>=100) return(dd); if (dd>=10) return(" "+dd); if (dd>=0) return(" "+dd); return(" 0"); } function z() { var zz=1-Math.random(); return(Math.sqrt(Math.log(1/(zz*zz)))*Math.cos(2*Math.PI*Math.random())); } function U(lb,ub) { var ll=(""+Math.round(ub)).length; var vv=""+(Math.floor(lb+Math.random()*(1+ub-lb))); while (vv.length

');
  write('//sigma='+sigma+', a='+a+', b='+b+', K='+K+', C='+C+'
')
  write('//I u_0 y_0 y_I
')
  write(' '+T+'; 0; 0; 0;
')
  write('startup x_min fix var x_max demand y_min fix var y_max
');
  for (ii=0; ii');
  write('

'); close(); }