Converting Max to Min objective

From: Arun Vishwanath (arunv_at_cs.anu.edu.au)
Date: 02/09/04 

Date: 8 Feb 2004 23:48:27 -0800

Hi,

I have an LP as follows...

max v
st
v-0.5x-0.5y<=0
x=1
y=1
bounds
0<=v<=1
integers
v
end

v,x and y can take on the value 0 or 1 only.

v gets the value 1 if and only if both x and y are 1 respectively, in
all other cases, v=0.

How can we convert this problem into a minimiztion problem (min v) so
that v again gets the value 1 if and only if x and y are 1
respectively ? For all other values of x and y, v must get the value
0.

Can you please let me know the formulation to get the above solution ?

Thanks
Arun