program to create matrix obeying constraints
4 Ansichten (letzte 30 Tage)
Ältere Kommentare anzeigen
Kommentiert: Matt J am 20 Sep. 2014
i have following code to create n*n matrix(say n=5 this time) which is following certain constraints.
% n = input ('Enter Num_Nodes :');
% inputData=input ('Enter inputdata :');
inputData=[5 1 2];
for z = 1:n
f = inputData(1,1); % f= Demand
S = inputData(1,2); % S= Source node
T = inputData(1,3); % T= Termination node
[idx,p] = sort(rand(n-1,f));
M = accumarray([reshape(p+(p>=T),,1),repmat([1:S-1,S+1:n]',f,1)],1,[n,n]);
M(1:n+1:n^2) = 0;
So, my o/p from following code is---
0 0 2 3 0
0 0 0 0 0
0 0 0 0 3
0 4 1 0 0
0 1 0 2 0
Note that as in given code
input S=1, so column 1 is zero and
As T=2, so row 2 is zero.
As f= 5, so sum of row S(i.e. S=1)=Sum of column T(i.e. T=2)= 5
and i am making diagonal elements zero.
all the remaining rows and columns, sum of row(i)=sum of column(i)
Now, How can i modify code such that row(1,3) will always come zero in output but output still follows previous mentioned constraints.
Bearbeitet: Matt J am 20 Sep. 2014
If you have the latext version of the Optimization Toolbox, you can use intlinprog to solve for the unknown elements of the matrix. You can choose any objective function that you want. See this recent thread for a very similar problem related to constraining rows and columns of matrices:
This assumes that you require the entries to be integer-valued and that a solution exists, see also My Comments. If they don't have to be integer-valued, you could just use linprog .
Find more on Linear Algebra in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!