Mixed integer problem I have three trucks delivery ice. Two trucks carry 15 tons, one carries 30 tons. It costs $150 to send the 30 ton truck to location 1; $200 to location 2; and $300 to location 3. I wish to minimize cost and each location must have a truck dispatched to it. X1 = location 1 X2 = location 2 X3 = location 3 Y1 = mixed integer (0,1 or yes no). How would I write the formula and and constraints? I am so burned out on linear programming -- 40 hours per week of studying!