//go to: https://www.lutanho.net/goodies/codetester.html //click on: (*)javascript //copy & paste: this text //click on: [run] //Bertrand Hellion, Bernard Penz, Fabien Mangione (2011): //A polynomial time algorithm to solve the //single-item capacitated lot sizing problem //with minimum order quantities and concave costs //MOQ: 200 //prod_setup_cost: U(100,300) //prod_unit_cost: U(10,30) //prod_capacity: U(211,267) //demand: U(180,220) //storage_setup_cost: U(10,30) //storage_unit_cost: U(1,3) var T=180; function U(lb,ub) { var ll=(""+Math.round(ub)).length; var vv=""+(Math.floor(lb+Math.random()*(1+ub-lb))); while (vv.length

');
  write('//I u_0 y_0 y_I
')
  write(' '+T+'; 0; 0; 0;
')
  write('startup x_min fix var up fix var x_max demand y_min fix var up fix var y_max
');
  for (ii=0; ii');
  write('

'); close(); }