Binary integer programing for maximization when x11, x12.... are present (not x1, x2... which can be found in documented example)

I want to use binary integer programing to optimize the following problem. Objective :

maxf(x)= c11*x11+c12*x12+c13*x13+ c21*x21+c22*x22+c23*x23+ c31*x31+c32*x32+c33*x33

Subject to: x11+x12+x13<=1
            x21+x22+x23<=1
            x31+x32+x33<=1
            x11+x21+x31<=1
            x12+x22+x32<=1
            x13+x23+x33<=1

x11,...to x33 are integers

Answer 1

[Matt J]

Looks like a job for BINTPROG

[Alan Weiss]

Or, if you have R2014a, you can use intlinprog.

Alan Weiss

MATLAB mathematical toolbox documentation