Re: [Help-glpk] minimax problem

[Oscar Gustafsson]

On Wed, 22 Nov 2006, David Curran wrote:
> param sweets:	   1        2	    3	     4	      5   	6	7 
> 8
> Alice	        	12	18	50	40	20	20	10 
> 5
> Bob		        5	10	35	30	15	22	30 
> 28
If I understand the problem correctly (pseudo-code quite close to 
MathProg):

range Kids := Alice, Bob;
range SweetRange := 1..8;

var PickedSweets[Kids]
var WorstSweets;
var SweetsPicks[Kids, SweetRange];

maximize WorstSweets

s.t.(kid in Kids) PickedSweets(kid) >= WorstSweets;

s.t.(kid in Kids) sum(sweet in SweetRange) sweets(kid, 
sweet)*SweetsPicke(kid, sweet) = PickedSweets(kid, sweet);

s.t.(sweet in SweetRange) sum(kid in KidsRange) SweetsPicks(kid, sweet) <= 
SweetSupply(sweet);


Regards Oscar