//Input data for Online Solver at https://www.lutanho.net/plt/lotsize.html
//The data is adapted from the article 
//Jill R. Hardin - George L. Nemhauser - Martin W. P. Savelsbergh (2007): 
//Analysis of Bounds for a Capacitated Single-item Lot-sizing Problem

//I u_0 y_0 y_I
  6; 0;  0;  0;
startup x_min fix var x_max demand y_min fix var y_max
   0;     0,   2,  0,   5;     0;     0,  0,  0,  999;
   0;     0,   4,  0,   5;     3;     0,  0,  0,  999;
   0;     0,   6,  0,  10;     4;     0,  0,  0,  999;
   0;     0,   8,  0,  10;     7;     0,  0,  0,  999;
   0;     0,  10,  0,   6;     7;     0,  0,  0,  999;
   0;     0,  12,  0,   6;     6;     0,  0,  0,  999;

----------------------------------------------------------------------

//I u_0 y_0 y_I
  7; 0;  0;  0;
startup x_min fix var x_max demand y_min fix var y_max
   0;     0,   7,  0,   1;     0;     0,  0,  0,  999;
   0;     0,   8,  0,  12;     1;     0,  0,  0,  999;
   0;     0,   5,  0,   2;     0;     0,  0,  0,  999;
   0;     0,   6,  0,  11;     2;     0,  0,  0,  999;
   0;     0,   3,  0,   3;     0;     0,  0,  0,  999;
   0;     0,   4,  0,   9;     3;     0,  0,  0,  999;
   0;     0,   1,  0,   6;     6;     0,  0,  0,  999;

----------------------------------------------------------------------

//I u_0 y_0 y_I
  6; 0;  0;  0;
startup x_min fix var x_max demand y_min fix var y_max
   0;     0,   6,  0,   2;     0;     0,  0,  0,  999;
   0;     0, 200,  0,  99;     1;     0,  0,  0,  999;
   0;     0, 196,  0,  99;     1;     0,  0,  0,  999;
   0;     0,   1,  0, 101;     1;     0,  0,  0,  999;
   0;     0,   4,  0,   1;     1;     0,  0,  0,  999;
   0;     0, 299,  0, 100;   100;     0,  0,  0,  999;