Adding files to GitHub

Author: hector1618

OR tut/HelloWorld.cpp

@@ -0,0 +1,7 @@
+#include<iostream.h>
+#include<conio.h>
+void main()
+{
+    cout<<"Hello World";
+    
+ }

OR tut/alternate.m

@@ -0,0 +1,50 @@
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+ if  XX(2,2,2)~=0 
+XX(2,1,3)=XX(2,2,1);
+i=2;j=2;uv=2;
+ else
+     [e r ] = find(XX(2:cm+1,2:cn+1,2)~=0);
+     e=e+1;
+     r=r+1;
+     jj=longestcontinuous(e,r)
+     XX(e(jj,1),1,3)=XX(e(jj,1),r(jj,1),1);
+     i=e(jj,1);j=r(jj,1);
+ end
+temp=0;uv=2;%% uv is ki u and v me se agla kya set karna hai
+
+while temp==0
+           switch uv
+               
+               case 1
+                   XX(i,1,3)=XX(i,j,1)-XX(1,j,3);
+                   
+               case 2
+                   XX(1,j,3)=XX(i,j,1)-XX(i,1,3);
+           end
+                uv = 0;
+                   if i<cm +1
+                       if XX(i+1,j,2)~=0
+                       uv=1;
+                       end
+                   end
+                   if j<cn+1
+                       if XX(i,j+1,2)~=0
+                       uv=2;
+                       end
+                   end
+                   if uv==2
+                       j=j+1;
+                   end
+                   if uv==1
+                       i=i+1;
+                   end
+                   
+                   if uv==0
+                       temp=1;
+                   end
+                   
+            if i>cm+1 || j>cn+1
+                temp=1;
+            end
+end %%while loop ends
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

OR tut/bb.m

@@ -0,0 +1,104 @@
+
+function [io im] = bb(type,A,B,C,S)
+global I
+I =0;
+global O
+O=[];
+global M;
+M=[];
+global zmax ;
+zmax = -10000000;
+global zmin;
+zmin = 10000000;
+bnb(type,A,B,C,S,I,O,M,zmax,zmin)
+[io ind]=max(O);
+
+im=M(:,ind);
+
+io
+im
+
+end
+
+
+function bnb(type,A,B,C,S,I,O,M,zmax,zmin)% 1 for max, -1 for min
+
+I=I+1;
+I
+O
+M
+zmax
+zmin
+keyboard 
+fprintf('Table number :%.0f',I)
+keyboard
+type
+A
+B
+C
+S
+[opt mat] = simplex(type,A,B,C,S);
+keyboard
+o=opt;
+m=mat;
+
+if sign(o) == -1 || min(m) < 0 
+            disp('sign is -1 or m is less than 0')
+            keyboard             
+            return
+end
+  
+ index = find ( ceil(m)~=m)
+ keyboard
+    if length(index)==0
+        disp('length of index is 0')
+        O(1,I) = o                                                   % global storage  
+        M(1:length(m) :I) = m(1:length(m))         % global storage
+        keyboard
+        return
+    end
+
+        
+ 
+       
+        
+           
+    switch type
+        case 1
+            
+            if o<zmax
+                fprintf('%.0f is not better than %.0f',o,zmax)
+                keyboard
+                return
+            end
+        case -1
+            
+            if o>zmin
+                fprintf('%.0f is not better than %.0f',o,zmin)
+                keyboard
+                return
+            end
+    end
+    
+      index(1,1)
+A1(1,size(A,2))=0;
+A1(1,index(1,1))=1;
+A=[A;A1]
+
+B=[B;ceil(m(index(1,1)))]
+S=[S;-1] 
+disp('goinginto bnb')
+keyboard
+bnb(type,A,B,C,S,I,O,M,zmax,zmin);
+   
+B(length(B),:)=[];
+S(length(S),:)=[];
+B=[B;floor(m(index(1,1)))]
+S=[S;1]
+disp('goinginto bnb')
+keyboard
+bnb(type,A,B,C,S,I,O,M,zmax,zmin);
+
+
+end
+

OR tut/bnb.m

@@ -0,0 +1,75 @@
+function [io im] = bb(type,A,B,C,S)
+bnb(type,A,B,C,S);
+[io ind]=max(O);
+
+im=M(:,ind);
+
+io
+im
+
+end
+
+global I=1;
+global O=[];
+global M=[];
+global zmax = -10000000;
+global zmin = 10000000;
+function bnb(type,A,B,C,S)% 1 for max, -1 for min
+fprintf('Table number :%.0f',I)
+[o m] = simplex(type,A,B,C,S)
+
+
+if sign(o) == -1 || min(m) < 0 
+            
+             I=I+1;
+            return
+end
+  
+ index = find ( ceil(m)~=m);
+    if length(index)==0
+        I=I+1;
+        O(1,I) = o;                                                   % global storage  
+        M(1:length(m) :I) = m(1:length(m)) ;        % global storage
+        return
+    end
+
+        
+ 
+       
+        
+           
+    switch type
+        case 1
+            
+            if o<zmax
+                fprintf('%.0f is not better than %.0f',o,zmax)
+                I=I+1;
+                return
+            end
+        case -1
+            
+            if o>zmin
+                fprintf('%.0f is not better than %.0f',o,zmin)
+                I=I+1;
+                return
+            end
+    end
+    
+    
+A1(1,size(A,2))=0;
+A1(1,index(1,1))=1;
+A=[A;A1];
+
+B=[B;ceil(m(index(1,1)))];
+S=[S;-1];
+
+bnb(type,A,B,C,S);
+B(length(B),:)=[];
+S(length(S),:)=[];
+B=[B;floor(m(index(1,1)))];
+S=[S;1];
+bnb(type,A,B,C,S);
+
+I=I+1;   
+end
+

OR tut/cycle.m

@@ -0,0 +1,64 @@
+function [y,bout,loop1]=cycle(x,row,col,b)
+% [y,bout]=cycle(x,row,col)
+% x: current solution (m*n)
+% b: entering basic variables (m*n)
+% row,col: index for element entering basis
+% y: solution after cycle of change (m*n)
+% bout: new basic variables after cycle of change (m*n)
+% loop1: the cycle through which theta has to be changed
+bout=b;
+y=x;
+[m,n]=size(x);
+loop=[row col]; % describes the cycle of change
+x(row,col)=Inf; % do not include (row,col) in the search
+b(row,col)=Inf;
+rowsearch=1;    % start searching in the same row
+while (loop(1,1)~=row | loop(1,2)~=col | length(loop)==2),
+  if rowsearch, % search in row
+    j=1;
+    while rowsearch 
+       if (b(loop(1,1),j)~=0) & (j~=loop(1,2))  
+         loop=[loop(1,1) j ;loop]; % add indices of found element to loop
+         rowsearch=0;  % start searching in columns
+       elseif j==n,    % no interesting element in this row
+         b(loop(1,1),loop(1,2))=0;
+         loop=loop(2:length(loop),:); % backtrack
+         rowsearch=0;
+       else
+         j=j+1; 
+       end
+    end
+  else  % column search
+    i=1;
+    while ~rowsearch
+       if (b(i,loop(1,2))~=0) & (i~=loop(1,1)) 
+         loop=[i loop(1,2) ; loop];
+         rowsearch=1;
+       elseif i==m
+         b(loop(1,1),loop(1,2))=0;
+         loop=loop(2:length(loop),:);
+         rowsearch=1;
+       else
+         i=i+1;
+       end
+     end
+  end
+end
+% compute maximal loop shipment
+loop1=loop;
+l=length(loop);
+theta=Inf;
+minindex=Inf;
+for i=2:2:l
+ if x(loop(i,1),loop(i,2))<theta,
+  theta=x(loop(i,1),loop(i,2));
+  minindex=i;
+ end;
+end
+% compute new transport matrix
+y(row,col)=theta;
+for i=2:l-1
+  y(loop(i,1),loop(i,2))=y(loop(i,1),loop(i,2))+(-1)^(i-1)*theta;
+end
+bout(row,col)=1;
+bout(loop(minindex,1),loop(minindex,2))=0;

OR tut/degeneracycorrect.m

@@ -0,0 +1,89 @@
+ function degeneracycorrect(X)
+        
+        
+        [m n] = size(X);
+        m=m-1;
+        n=n-1;
+        x(3:m+2,3:n+2)=X(2:m+1,2:n+1);
+        x(1:2,1:2)=0;
+        x(1,:)=0;x(:,1)=0;
+        if sum(sum(x))~=sum(X(1,:))
+            disp('not balanced')
+            return
+        end
+        
+        N=m+n-1-length(find(x(3:m+2,3:n+2)~=0));
+        if N>0
+            for p=1:m
+                x(p+2,2)=length(find(x(p+2,3:n+2)~=0));
+                end
+                for p=1:n
+                x(2,p+2)=length(find(x(3:m+2,p+2)~=0));
+                end
+         
+            while(sum(x(2,:))>0&&sum(x(:,2))>0)  
+                
+               
+                
+                h=find(x(2,3:n+2)==max(x(2,3:n+2)))+2;
+                v=find(x(3:m+2,2)==max(x(3:m+2,2)))+2;
+                if x(2,h(1,1))>x(v(1,1),2) 
+                    
+                        x(1,h(1,1))=1;
+                        x(2:n+2,h(1,1))=0;
+                    
+                    
+                    else
+                    if x(v(1,1),2)>1
+                        x(v(1,1),1)=1;
+                        x(v(1,1),2:n+2)=0;
+                    else
+                        if sum(x(1,:))>sum(x(:,1))
+                             x(v(1,1),1)=1;
+                             x(v(1,1),2:n+2)=0; 
+                             x(2:n+2,h(1,1))=0;
+                        else
+                            H=find(x(v(1,1),3:n+2)==max(x(v(1,1),3:n+2)))+2;
+                            x(v(1,1),H)=0;
+                            x(1,H)=1;
+                            x(2:m+2,H)=0;
+                        end
+                    end
+                end
+                for p=1:m
+                x(p+2,2)=length(find(x(p+2,3:n+2)~=0));
+                end
+                for p=1:n
+                x(2,p+2)=length(find(x(3:m+2,p+2)~=0));
+                end
+            end
+           
+            
+           h=find(x(1,:)==1)-1;
+           v=find(x(:,1)==1)-1;
+           p=(length(v));
+           p1=(length(h));
+           for pqqq=1:length(h)
+               
+               for pqqq1 = 1:length(v)
+                   
+                   
+                   if N>0
+                       if X(v(p,1),h(1,p1))==0
+                       X(v(p,1),h(1,p1))=0.01;
+                       N=N-1;
+                       end                   
+                   end
+                   p1=p1-1;
+               end
+               p=p-1;
+           end
+               
+            X
+            
+            
+        end
+ 
+          
+            
+end