Originally posted by: kanamitz@jp.ibm.com

How can I write objective function to minimize variation.

 

Problem:

There is a (n, m) matrix with binary value(0,1) which describe option of choices.

And their rows have a category.

Constraint: Need to choose one option in a category.

Objective: Minimize variation of pattern chosen.

 

For instance

Input(row 1,2 are in category A, row 3-5 are in category B)

A 0 1 0 1

A 1 1 1 1

B 0 0 1 0

B 1 1 1 1

B 1 1 1 0

 

Expected Output

(Options are chosen in each category and chosen pattern variation are all same. so variation is one. )

A 0 0 0 0

A 1 1 1 1

B 0 0 0 0

B 1 1 1 1

B 0 0 0 0

 

I thought minimize sum_i,j,k (a_i,j&&a_k,j) should be okay but I don't understand how I can write that as a code.

#DecisionOptimization
#MathematicalProgramming-General

Originally posted by: kanamitz@jp.ibm.com

Note:

When I wrote below I am said that v1 is not exist(second one).

sum(v1 in Var1, v2 in Var2, v3 in Var3) A[v1][v2][v3]&&A[v1][v2][v3] <= 5;

#DecisionOptimization
#MathematicalProgramming-General

Hi,

can you attach your .mod ?

regards

#DecisionOptimization
#MathematicalProgramming-General

Originally posted by: kanamitz@jp.ibm.com

@AlexFleischer Thank you for your reply.

Here it is.
 

#DecisionOptimization
#MathematicalProgramming-General

Hi,

can you change your objective into

minimize
     sum(q1 in V1, q2 in V2, v3 in V3)
         sum(v1 in V1, v2 in V2, v3 in V3)
                 ((d[v1][v2][v3]) * (d[q1][q2][v3]));

?

regards

#DecisionOptimization
#MathematicalProgramming-General