<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: generate a constrained latin square in SAS/IML Software and Matrix Computations</title>
    <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181812#M1819</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I can't suggest anything else because I don't understand the question. It is too complicated. However, others on this forum know more about experimental designs/Latin Squares and might have additional ideas.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Fri, 21 Feb 2014 19:01:58 GMT</pubDate>
    <dc:creator>Rick_SAS</dc:creator>
    <dc:date>2014-02-21T19:01:58Z</dc:date>
    <item>
      <title>generate a constrained latin square</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181808#M1815</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;SPAN style="font-size: 12pt;"&gt;Dear Everybody,&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;I want to create a 5x8 matrix with random integer numbers with a large number of constraints.&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;I want something like a latin square respecting a some constraints.&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;&lt;/SPAN&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;&lt;/SPAN&gt; &lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;&lt;/SPAN&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;One of the possible candidates is:&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;&lt;/SPAN&gt; &lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Area1&amp;nbsp; Area2&amp;nbsp; Area3 Area4&amp;nbsp; Area5&amp;nbsp; Area6&amp;nbsp; Area7 Area8&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp; &lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;Subject 1&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 1&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 3&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 4&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 5&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 6&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 7&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 8&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp; &lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;Subject 2&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 1&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 3&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 5&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 4&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 7&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 8&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 6&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp; &lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;Subject 3&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 1&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 4&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 5&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 3&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 8&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 6&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 7&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp; &lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;Subject 4&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 5&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 1&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 4&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 6&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 3&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 7&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 8&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp; &lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;Subject 5&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 1&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 3&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 4&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 7&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 5&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 8&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 6&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;Let Nij be the number of time that the number i=1 appears in the area j=1&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;The constraints are:&lt;/SPAN&gt;&lt;/P&gt;&lt;OL&gt;&lt;LI&gt;&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif';"&gt;2&amp;lt;=n11&amp;lt;=3&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif';"&gt;2&amp;lt;=n12&amp;lt;=3&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="PT-BR" style="font-family: 'Arial','sans-serif'; mso-ansi-language: PT-BR;"&gt;1&amp;lt;=n23&amp;lt;=2, 1&amp;lt;=n24 &amp;lt;=2, 0&amp;lt;=n21 &amp;lt;=1, 0&amp;lt;=n22 &amp;lt;=1, 0&amp;lt;=n25 &amp;lt;=1,0&amp;lt;=n26 &amp;lt;=1&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="PT-BR" style="font-family: 'Arial','sans-serif'; mso-ansi-language: PT-BR;"&gt;1&amp;lt;=n33&amp;lt;=2, 1&amp;lt;=n34 &amp;lt;=2, 0&amp;lt;=n31 &amp;lt;=1, 0&amp;lt;=n32 &amp;lt;=1, 0&amp;lt;=n35 &amp;lt;=1,0&amp;lt;=n36 &amp;lt;=1&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="PT-BR" style="font-family: 'Arial','sans-serif'; mso-ansi-language: PT-BR;"&gt;1&amp;lt;=n43&amp;lt;=2, 1&amp;lt;=n44 &amp;lt;=2, 0&amp;lt;=n41 &amp;lt;=1, 0&amp;lt;=n42 &amp;lt;=1, 0&amp;lt;=n45 &amp;lt;=1,0&amp;lt;=n46 &amp;lt;=1&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN style="font-family: 'Arial','sans-serif'; mso-ansi-language: FR;"&gt;1&amp;lt;=n53 &amp;lt;=2,1&amp;lt;=n54 &amp;lt;=2, 0&amp;lt;=n51 &amp;lt;=1, 0&amp;lt;=n52 &amp;lt;=1, 0&amp;lt;=n55 &amp;lt;=1, 0&amp;lt;=n56&amp;lt;=1&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="PT-BR" style="font-family: 'Arial','sans-serif'; mso-ansi-language: PT-BR;"&gt;0&amp;lt;=n65&amp;lt;=1, 0&amp;lt;=n66 &amp;lt;=1, 0&amp;lt;=n75 &amp;lt;=1, 0&amp;lt;=n76 &amp;lt;=1, 0&amp;lt;=n85&amp;lt;=1,&amp;nbsp; 0&amp;lt;=n86 &amp;lt;=1&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="PT-BR" style="font-family: 'Arial','sans-serif'; mso-ansi-language: PT-BR;"&gt;1&amp;lt;=n67&amp;lt;=2, 1&amp;lt;=n68 &amp;lt;=2, 1&amp;lt;=n77 &amp;lt;=2, 1&amp;lt;=n78 &amp;lt;=2, 1&amp;lt;=n87 &amp;lt;=2, 1&amp;lt;=n88 &amp;lt;=2&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="PT-BR" style="font-family: 'Arial','sans-serif'; mso-ansi-language: PT-BR;"&gt;n13=n14= n15= n16= n17= n18=0&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="PT-BR" style="font-family: 'Arial','sans-serif'; mso-ansi-language: PT-BR;"&gt;n27=n28= n37 = n38= n47 = n48= n57 = n58=0&lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif';"&gt;n61= n62= n63= n64= 0 &lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif';"&gt;n71= n72= n73= n74= 0 &lt;/SPAN&gt;&lt;/LI&gt;&lt;LI&gt;&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif';"&gt;n81= n82= n83= n84= 0 &lt;/SPAN&gt;&lt;/LI&gt;&lt;/OL&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I am looking for more than one solution.&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif'; mso-ansi-language: EN-US;"&gt;The solution will allow me getting a partial balance according to my maximum number of subjects of 5.&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif'; mso-ansi-language: EN-US;"&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;I tried one solution but it is unacceptable time consuming approach:&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;1- generate a high number of latin square&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;2- Use the proc surveyselect to extract blocks of eight subjects respecting all the constraints&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;&lt;/SPAN&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;The number of possibilities are very high and the probability to get a block of subjects respecting all the conditions is very low.&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-size: 12pt;"&gt;Thanks in advance for all the help you can provide me.&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;Samir&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif';"&gt; &lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN lang="EN-US" style="font-family: 'Arial','sans-serif'; mso-ansi-language: EN-US;"&gt;&lt;/SPAN&gt; &lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 21 Feb 2014 14:17:31 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181808#M1815</guid>
      <dc:creator>Sam28041977</dc:creator>
      <dc:date>2014-02-21T14:17:31Z</dc:date>
    </item>
    <item>
      <title>Re: generate a constrained latin square</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181809#M1816</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;SPAN style="font-size: 12pt; font-family: CMR10;"&gt;Is there a context for this problem? For example, this seems to have some features that are similar to constructing a &lt;A href="http://www.jstatsoft.org/v29/c01/paper"&gt;Williams design for randomized assignment of patients in crossover clinical trials.&lt;/A&gt; &lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-size: 12pt; font-family: CMR10;"&gt;Have you considered posing this as a linear programming problem?&amp;nbsp; SAS/IML has the LP subroutine (or use SAS/OR software, if you have that licensed).&amp;nbsp; &lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-size: 12pt; font-family: CMR10;"&gt;If someone told me to solve this problem, the first thing I'd do is cut the size in half. For example, I'd try to solve the problem with 2 subjects and 3 or 4 areas.&amp;nbsp; I would have an easier time explaining the problem to others, and I would expect to learn lots of useful information by solving the simplified problem.&lt;/SPAN&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 21 Feb 2014 15:01:21 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181809#M1816</guid>
      <dc:creator>Rick_SAS</dc:creator>
      <dc:date>2014-02-21T15:01:21Z</dc:date>
    </item>
    <item>
      <title>Re: generate a constrained latin square</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181810#M1817</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;BR /&gt;Dear Dr Wicklin,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Thanks a lot for your quick answer.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;You right, the design looks like a cross-over design.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Ttreatment comparisons are done within subject.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;The period factor is substituted by an area factor.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;The difference in this design, is that my constraints are not only balance constrainsts. I have external constraints that make for example that treatment 1 should be tested only on area 1 or 2.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I think that SAS/IML is the most adequate way&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I have a sas IML licence but no SAS/OR licence.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I will try to learn more about the LP subroutine.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;It will be great if you can tell me more about the solution you suggest me.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Many thanks.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 21 Feb 2014 15:41:14 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181810#M1817</guid>
      <dc:creator>Sam28041977</dc:creator>
      <dc:date>2014-02-21T15:41:14Z</dc:date>
    </item>
    <item>
      <title>Re: generate a constrained latin square</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181811#M1818</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I want just add one precision.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I am looking for partial balance over my block of five subjects.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I don't know if we can get this balance by cutting the size of the matrix in half.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Brs&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 21 Feb 2014 16:00:12 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181811#M1818</guid>
      <dc:creator>Sam28041977</dc:creator>
      <dc:date>2014-02-21T16:00:12Z</dc:date>
    </item>
    <item>
      <title>Re: generate a constrained latin square</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181812#M1819</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I can't suggest anything else because I don't understand the question. It is too complicated. However, others on this forum know more about experimental designs/Latin Squares and might have additional ideas.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 21 Feb 2014 19:01:58 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181812#M1819</guid>
      <dc:creator>Rick_SAS</dc:creator>
      <dc:date>2014-02-21T19:01:58Z</dc:date>
    </item>
    <item>
      <title>Re: generate a constrained latin square</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181813#M1820</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I think I can see what Samir would like, so I may be able to help.&amp;nbsp; There are a lot of constraints for a relatively small problem, so one approach would be to enumerate all possible solutions that meet the constraints and then pick from them at random. I think this is feasible, but it may involve less programming to implement an iterative improvement search algorithm to search for a single solution found at random.&amp;nbsp; I have created an algorithm that starts from a randomly chosen design (5 random permuations of 1 to &lt;span class="lia-unicode-emoji" title=":smiling_face_with_sunglasses:"&gt;😎&lt;/span&gt; and then seeks to swap samples within subject rows to improve the balance. The key to this is choosing a suitable criterion to optimize.&amp;nbsp; I have converted the constraints into the matrix t which puts the 8 samples in the rows, and the 8 areas in the columns, and the entries give the midpoint of the range of allowed frequencies permitted by your list of constraints.&amp;nbsp; So the entry of 1.5 in cell (2,3) indicates that sample 2 is allowed in area 3 either once or twice.&amp;nbsp; Any design can now be evaluated in the following way, first its sample x area frequency matrix is calculated (the module afreq does this), then the matrix t can be subtracted from it to form a difference matrix. If the design matches all the constraints, then the difference matrix will be zero wherever t contains a zero, and all other entries with contain the value -0.5 or +0.5.&amp;nbsp; As there are 38 non-zero entries in t, all constraints are matched when the sum of the squares of the difference matrix is 38 * 0.5 * 0.5 = 9.5.&amp;nbsp; Any design that does not match the constraints must have a sum of squares higher than this.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Using the above, it is then relatively simple to design a search algorithm that keeps going until an example design is found with a minimum criterion of 9.5.&amp;nbsp; My IML program is attached.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I have never tried using LP solutions for these types of design problem, so I would be interested to know how difficult or easy this might be.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sat, 22 Feb 2014 17:56:22 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181813#M1820</guid>
      <dc:creator>IanWakeling</dc:creator>
      <dc:date>2014-02-22T17:56:22Z</dc:date>
    </item>
    <item>
      <title>Re: generate a constrained latin square</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181814#M1821</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Dear Ian,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;The way you formulated the problem is simply wonderfull!&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;I cannot thank you enough for the help you provide me.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;The program output is exactly what I want.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Best regards,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Samir&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sun, 23 Feb 2014 10:35:06 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/generate-a-constrained-latin-square/m-p/181814#M1821</guid>
      <dc:creator>Sam28041977</dc:creator>
      <dc:date>2014-02-23T10:35:06Z</dc:date>
    </item>
  </channel>
</rss>

