forked from ptigwe/lh-vector
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlemke.c
1491 lines (1366 loc) · 39 KB
/
lemke.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* \file lemke.c
* LCP solver
*
* 13 July 2000
* Author: Bernhard von Stengel [email protected]
*
* Edited: Tobenna Peter, Igwe [email protected] August, 2012
*/
#include <stdio.h>
#include <stdlib.h>
/* free() */
#include <string.h>
/* strcpy */
#include "alloc.h"
#include "col.h"
#include "lemke.h"
#include "mp.h"
#include "equilibrium.h"
/* used for tableau: */
#define Z(i) (i)
#define W(i) (i+n)
/* VARS = 0..2n = Z(0) .. Z(n) W(1) .. W(n) */
/* ROWCOL = 0..2n, 0 .. n-1: tabl rows (basic vars) */
/* n .. 2n: tabl cols 0..n (cobasic) */
#define RHS (n+1) /* q-column of tableau */
#define TABCOL(v) (bascobas[v]-n)
/* v in VARS, v cobasic: TABCOL(v) is v's tableau col */
/* v basic: TABCOL(v) < 0, TABCOL(v)+n is v's row */
/* LCP input */
Rat **lcpM;
Rat *rhsq;
Rat *vecd;
int lcpdim = 0; /* set in setlcp */
static int n; /* LCP dimension as used here */
/* LCP result */
Rat *solz;
int pivotcount;
/* tableau: */
static mp **A; /**< tableau */
static int *bascobas; /**< VARS -> ROWCOL */
static int *whichvar; /**< ROWCOL -> VARS, inverse of bascobas */
/** scale factors for variables z.
* scfa[Z(0)] for d, scfa[RHS] for q
* scfa[Z(1..n)] for cols of M
* result variables to be multiplied with these
*/
static mp *scfa;
static mp det; /**< determinant */
static int *lextested, *lexcomparisons;/**< statistics for lexminvar */
static int *leavecand;
/**< should be local to lexminvar but defined globally for economy */
/* GSoC12: Tobenna Peter, Igwe */
int nrows;
int ncols;
int k;
int k2;
Rat** payoffA;
Rat** payoffB;
mp** invAB; /**< Represents the inverse of AB */
node* neg;
node* pos;
/*------------------ error message ----------------*/
/**
* Prints out an error message and exits.
*
* \param info The error message
*/
void errexit (char *info)
{
fflush(stdout);
fprintf(stderr, "Error: %s\n", info);
fprintf(stderr, "Lemke terminated unsuccessfully.\n");
exit(1);
}
/* declares */
int assertbasic (int v, const char *info);
/*------------------ memory allocation -------------------------*/
/**
* Allocates memory for the LCP given its dimensions.
* If the LCP has been previously allocated, it frees the memory and
* reallocates it. If the dimension given for the LCP is < 0 or
* > MAXLCPDIM then it exits with an error.
*
* \param newn The dimension of the LCP.
*/
void setlcp (int newn)
{
if (newn < 1 || newn > MAXLCPDIM)
{
fprintf(stderr, "Problem dimension n= %d not allowed. ", newn);
fprintf(stderr, "Minimum n is 1, maximum %d.\n", MAXLCPDIM);
exit(1);
}
if (lcpdim > 0) /* free previously used space */
{
FREE2(lcpM, lcpdim);
free(rhsq);
free(vecd);
free(solz);
FREE2(A, lcpdim);
free(scfa);
free(bascobas);
free(whichvar);
free(leavecand);
FREE2(invAB, lcpdim);
}
n = lcpdim = newn;
/* LCP input/output data */
T2ALLOC (lcpM, n, n, Rat);
rhsq = TALLOC(n, Rat);
vecd = TALLOC(n, Rat);
solz = TALLOC(n, Rat);
/* tableau */
T2ALLOC (A, n, n+2, mp);
scfa = TALLOC (n+2, mp);
bascobas = TALLOC(2*n+1, int);
whichvar = TALLOC(2*n+1, int);
lextested = TALLOC(n+1, int);
lexcomparisons = TALLOC(n+1, int);
leavecand = TALLOC(n, int);
/* should be local to lexminvar but allocated here for economy */
/* initialize all LCP entries to zero */
{
int i,j;
Rat zero = ratfromi(0);
for (i=0; i<n; i++)
{
for (j=0; j<n; j++)
lcpM [i] [j] = zero;
vecd [i] = rhsq [i] = zero;
}
}
T2ALLOC(invAB, n, n, mp);
} /* end of setlcp(newn) */
/**
* Checks that the values for q and d are valid.
* Asserts that d >= 0 and not q >= 0 (o/w trivial sol)
* and that q[i] < 0 implies d[i] > 0
*/
/* GSoC12: Tobenna Peter, Igwe (Edited)*/
void isqdok (void)
{
int i;
int isqpos = 1;
for (i=0; i<n; i++)
{
/*if (vecd[i].num < 0) *//*GSOC*/
if (negative(vecd[i].num))
{
char str[MAXSTR];
rattoa(vecd[i], str);
fprintf(stderr, "Covering vector d[%d] = %s negative\n",
i+1, str);
errexit("Cannot start Lemke.");
}
/*else if (rhsq[i].num < 0) *//*GSOC*/
else if (negative(rhsq[i].num))
{
isqpos = 0;
/*if (vecd[i].num == 0) *//*GSOC*/
if (zero(vecd[i].num))
{
char str[MAXSTR];
rattoa(rhsq[i], str);
fprintf(stderr, "Covering vector d[%d] = 0 ", i+1);
fprintf(stderr, "where q[%d] = %s is negative.\n",
i+1, str);
errexit("Cannot start Lemke.");
}
}
} /* end of for(i=...) */
if (isqpos)
{
printf("No need to start Lemke since q>=0. ");
printf("Trivial solution z=0.\n");
exit(0);
}
} /* end of isqdok() */
/* ------------------- tableau setup ------------------ */
/**
* Initialise tableau variables.
* Z(0)...Z(n) nonbasic, W(1)...W(n) basic
*/
void inittablvars (void)
{
int i;
for (i=0; i<=n; i++)
{
bascobas[Z(i)] = n+i;
whichvar[n+i] = Z(i);
}
for (i=1; i<=n; i++)
{
bascobas[W(i)] = i-1;
whichvar[i-1] = W(i);
}
} /* end of inittablvars() */
/**
* Fill tableau from M, q, d
*/
/* GSoC12: Tobenna Peter, Igwe (Edited)*/
void filltableau (void)
{
int i,j;
mp den, num;
mp tmp, tmp2, tmp3;
for (j=0; j<=n+1; j++)
{
/* compute lcm scfa[j] of denominators for col j of A */
itomp(ONE, scfa[j]);
for (i=0; i<n; i++)
{
/*den = (j==0) ? vecd[i].den :
(j==RHS) ? rhsq[i].den : lcpM[i][j-1].den ; *//*GSOC*/
if(j == 0)
{
copy(den, vecd[i].den);
}
else if(j == RHS)
{
copy(den, rhsq[i].den);
}
else
{
copy(den, lcpM[i][j-1].den);
}
copy(tmp, den);
lcm(scfa[j], tmp);
}
/* fill in col j of A */
for (i=0; i<n; i++)
{
/*
den = (j==0) ? vecd[i].den :
(j==RHS) ? rhsq[i].den : lcpM[i][j-1].den ;*//*GSOC*/
if(j == 0)
{
copy(den, vecd[i].den);
}
else if(j == RHS)
{
copy(den, rhsq[i].den);
}
else
{
copy(den, lcpM[i][j-1].den);
}
/*num = (j==0) ? vecd[i].num :
(j==RHS) ? rhsq[i].num : lcpM[i][j-1].num ;*//*GSOC*/
if(j == 0)
{
copy(num, vecd[i].num);
}
else if(j == RHS)
{
copy(num, rhsq[i].num);
}
else
{
copy(num, lcpM[i][j-1].num);
}
/* cols 0..n of A contain LHS cobasic cols of Ax = b */
/* where the system is here -Iw + dz_0 + Mz = -q */
/* cols of q will be negated after first min ratio test */
/* A[i][j] = num * (scfa[j] / den), fraction is integral */
/*itomp (den, tmp);*/ /*GSOC*/
copy(tmp, den);
copy (tmp3, scfa[j]);
divint(tmp3, tmp, tmp2); /* divint modifies 1st argument */
/*itomp (num, tmp);*/ /*GSOC*/
copy(tmp, num);
mulint(tmp2, tmp, A[i][j]);
}
} /* end of for(j=...) */
inittablvars();
itomp (ONE, det);
changesign(det);
} /* end of filltableau() */
/* ---------------- output routines ------------------- */
/**
* Prints the LCP to the standard output
*/
void outlcp (void)
/* output the LCP as given */
{
int i,j ;
Rat a;
char s[LCPSTRL];
printf("LCP dimension: %d\n", n);
colset(n + 2);
for (j=0; j<n; j++)
colpr("");
colpr("d");
colpr("q");
colnl();
for (i=0; i<n; i++)
{
for (j=0; j<n; j++)
{
a = lcpM [i] [j];
if (a.num == 0)
colpr(".");
else
{
rattoa(a, s);
colpr(s);
}
}
rattoa( vecd [i], s);
colpr(s);
rattoa( rhsq [i], s);
colpr(s);
}
colout();
}
/**
* Create a string s representing v in VARS, e.g. "w2"
*
* \param v Variable to be converted
* \param s String to be created
* \returns length of string s
*/
int vartoa(int v, char s[])
{
if (v > n)
return sprintf(s, "w%d", v-n);
else
return sprintf(s, "z%d", v);
}
/**
* Output the current tableau, column-adjusted
*/
void outtabl (void)
{
int i, j;
char s[INFOSTRINGLENGTH];
char smp [DIG2DEC(MAX_DIGITS)+2]; /* string to print mp into */
mptoa (det, smp);
printf("Determinant: %s\n", smp);
colset(n+3);
colleft(0);
colpr("var"); /* headers describing variables */
for (j=0; j<=n+1; j++)
{
if (j==RHS)
colpr("RHS");
else
{
vartoa(whichvar[j+n], s);
colpr(s);
}
}
colpr("scfa"); /* scale factors */
for (j=0; j<=n+1; j++)
{
if (j==RHS)
mptoa(scfa[RHS], smp);
else if (whichvar[j+n] > n) /* col j is some W */
sprintf(smp, "1");
else /* col j is some Z: scfa */
mptoa( scfa[whichvar[j+n]], smp);
colpr(smp);
}
colnl();
for (i=0; i<n; i++) /* print row i */
{
vartoa(whichvar[i], s);
colpr(s);
for (j=0; j<=n+1; j++)
{
mptoa( A[i][j], smp);
if (strcmp(smp, "0")==0)
colpr(".");
else
colpr(smp);
}
}
colout();
printf("-----------------end of tableau-----------------\n");
} /* end of outtabl() */
/**
* Output the current basic solution
*/
void outsol (void)
{
char s[INFOSTRINGLENGTH];
char smp [2*DIG2DEC(MAX_DIGITS)+4];
/* string to print 2 mp's into */
int i, row, pos;
mp num, den;
colset(n+2); /* column printing to see complementarity of w and z */
colpr("basis=");
for (i=0; i<=n; i++)
{
if (bascobas[Z(i)]<n)
/* Z(i) is a basic variable */
vartoa(Z(i), s);
else if (i>0 && bascobas[W(i)]<n)
/* Z(i) is a basic variable */
vartoa(W(i), s);
else
strcpy (s, " ");
colpr(s);
}
colpr("z=");
for (i=0; i<=2*n; i++)
{
if ( (row = bascobas[i]) < n) /* i is a basic variable */
{
if (i<=n) /* printing Z(i) */
/* value of Z(i): scfa[Z(i)]*rhs[row] / (scfa[RHS]*det) */
mulint(scfa[Z(i)], A[row][RHS], num);
else /* printing W(i-n) */
/* value of W(i-n) is rhs[row] / (scfa[RHS]*det) */
copy(num, A[row][RHS]);
mulint(det, scfa[RHS], den);
reduce(num, den);
pos = mptoa(num, smp);
if (!one(den)) /* add the denominator */
{
sprintf(&smp[pos], "/");
mptoa(den, &smp[pos+1]);
}
colpr(smp);
}
else /* i is nonbasic */
colpr("0");
if (i==n) /* new line since printing slack vars w next */
{
colpr("w=");
colpr(""); /* for complementarity in place of W(0) */
}
} /* end of for (i=...) */
colout();
printf("\n Number of pivots: %d\n", pivotcount);
} /* end of outsol */
/**
* Current basic solution turned into solz [0..n-1].
* Note that Z(1)..Z(n) become indices 0..n-1.
*
* \returns 0
*/
/* GSoC12: Tobenna Peter, Igwe (Edited)*/
Bool notokcopysol (void)
{
Bool notok = 0;
int i, row;
mp num, den;
for (i=1; i<=n; i++)
if ( (row = bascobas[i]) < n) /* i is a basic variable */
{
/* value of Z(i): scfa[Z(i)]*rhs[row] / (scfa[RHS]*det) */
mulint(scfa[Z(i)], A[row][RHS], num);
mulint(det, scfa[RHS], den);
reduce(num, den);
/*
if ( mptoi(num, &(solz[i-1].num), 1) )
{
printf("(Numerator of z%d overflown)\n", i);
notok = 1;
}
if ( mptoi(den, &(solz[i-1].den), 1) )
{
printf("(Denominator of z%d overflown)\n", i);
notok = 1;
}*//*GSOC*/
copy(solz[i-1].num, num);
copy(solz[i-1].den, den);
}
else /* i is nonbasic */
solz[i-1] = ratfromi(0);
return notok;
} /* end of copysol */
/* --------------- test output and exception routines ---------------- */
/**
* Assert that v in VARS is a basic variable.
* If v is not basic, then the program terminates with an error message
*
* \param v The variable to be asserted
* \param info Part of the error message.
*/
int assertbasic (int v, const char *info)
{
char s[INFOSTRINGLENGTH];
if (bascobas[v] >= n)
{
vartoa(v, s);
fprintf(stderr, "%s: Cobasic variable %s should be basic.\n", info, s);
/*errexit("");*/
return -1;
}
return 0;
}
/**
* Assert that v in VARS is a cobasic variable.
* If v is not cobasic, the program terminates with an error message
*
* \param v The variable to be asserted
* \param info Part of the error message
*/
int assertcobasic (int v, char *info)
{
char s[INFOSTRINGLENGTH];
if (TABCOL(v) < 0)
{
/*
vartoa(v, s);
fprintf(stderr, "%s: Basic variable %s should be cobasic.\n", info, s);
errexit("");*/
return -1;
}
return 0;
}
/**
* Document the current pivot.
* Asserts leave is basic and enter is cobasic, and
* print the current pivot
*
* \param leave The leaving variable
* \param enter The entering variable
*/
int docupivot (int leave, int enter, Flagsrunlemke flags)
{
char s[INFOSTRINGLENGTH];
if(assertbasic(leave, "docupivot") < 0)
return -1;
if(assertcobasic(enter, "docupivot") < 0)
return -1;
if(flags.boutpiv)
{
vartoa(leave, s);
printf("leaving: %-4s ", s);
vartoa(enter, s);
printf("entering: %s\n", s);
}
return 0;
} /* end of docupivot */
/**
* Outputs an error message and exits when a ray termination
* occurs while trying to pivot in the entering variable.
*
* \param enter The entering variable.
*/
void raytermination (int enter)
{
char s[INFOSTRINGLENGTH];
vartoa(enter, s);
fprintf(stderr, "Ray termination when trying to enter %s\n", s);
outtabl();
printf("Current basis, not an LCP solution:\n");
outsol();
errexit("");
}
/**
* Tests the tableau variables. If the tableau variables are wrong,
* output error and continue.
*/
void testtablvars(void)
{
int i, j;
for (i=0; i<=2*n; i++) /* check if somewhere tableauvars wrong */
if (bascobas[whichvar[i]]!=i || whichvar[bascobas[i]]!=i)
/* found an inconsistency, print everything */
{
printf("Inconsistent tableau variables:\n");
for (j=0; j<=2*n; j++)
{
printf("var j:%3d bascobas:%3d whichvar:%3d ",
j, bascobas[j], whichvar[j]);
printf(" b[w[j]]==j: %1d w[b[j]]==j: %1d\n",
bascobas[whichvar[j]]==j, whichvar[bascobas[j]]==j);
}
break;
}
}
/* --------------- pivoting and related routines -------------- */
/**
* Complement of v in VARS. Error if v==Z(0).
* This is W(i) for Z(i) and vice versa, i=1...n.
*
* \param v The variable
* \returns The complement of v. Z(i) if v is W(i) and vice versa.
*/
int complement (int v)
{
if (v==Z(0))
errexit("Attempt to find complement of z0.");
return (v > n) ? Z(v-n) : W(v) ;
} /* end of complement (v) */
/**
* Initialize statistics for minimum ratio test
*/
void initstatistics(void)
{
int i;
for (i=0; i<=n; i++)
lextested[i] = lexcomparisons[i] = 0;
}
/**
* Output statistics of minimum ratio test
*/
void outstatistics(void)
{
int i;
char s[LCPSTRL];
colset(n+2);
colleft(0);
colpr("lex-column");
for (i=0; i<=n; i++)
colipr(i);
colnl();
colpr("times tested");
for (i=0; i<=n; i++)
colipr(lextested[i]);
colpr("% times tested");
if (lextested[0] > 0)
{
colpr("100");
for (i=1; i<=n; i++)
{
sprintf(s, "%2.0f",
(double) lextested[i] * 100.0 / (double) lextested[0]);
colpr(s);
}
}
else
colnl();
colpr("avg comparisons");
for (i=0; i<=n; i++)
if (lextested[i] > 0)
{
sprintf(s, "%1.1f",
(double) lexcomparisons[i] / (double) lextested[i]);
colpr(s);
}
else
colpr("-");
colout();
}
/**
* Returns the leaving variable in VARS. This is given by lexmin row,
* when enter in VARS is entering variable
* only positive entries of entering column tested
* boolean *z0leave indicates back that z0 can leave the
* basis, but the lex-minratio test is performed fully,
* so the returned value might not be the index of z0.
*
* \param enter The entering variable
* \param z0leave Stores a boolean value stating if z0 can leave.
* \returns The leaving variable
*/
int lexminvar (int enter, int *z0leave)
{
int col, i, j, testcol;
int numcand;
assertcobasic(enter, "Lexminvar");
col = TABCOL(enter);
numcand = 0;
/* leavecand [0..numcand-1] = candidates (rows) for leaving var */
/* start with leavecand = { i | A[i][col] > 0 } */
for (i=0; i<n; i++)
if (positive (A[i][col]))
leavecand[numcand++] = i;
if (numcand==0)
return -1;
/*raytermination(enter);*/
if (numcand==1)
{
lextested[0] += 1 ;
lexcomparisons[0] += 1 ;
*z0leave = (leavecand[0] == bascobas[Z(0)]);
}
for (j = 0; numcand > 1; j++)
/* as long as there is more than one leaving candidate perform
* a minimum ratio test for the columns of j in RHS, W(1),... W(n)
* in the tableau. That test has an easy known result if
* the test column is basic or equal to the entering variable.
*/
{
if (j>n) /* impossible, perturbed RHS should have full rank */
errexit("lex-minratio test failed");
lextested[j] += 1 ;
lexcomparisons[j] += numcand ;
testcol = (j==0) ? RHS : TABCOL(W(j)) ;
if (testcol != col) /* otherwise nothing will change */
{
if (testcol >= 0)
/* not a basic testcolumn: perform minimum ratio tests */
{
int sgn;
int newnum = 0;
/* leavecand[0..newnum] contains the new candidates */
for (i=1; i < numcand; i++)
/* investigate remaining candidates */
{
sgn = comprod(A[leavecand[0]][testcol], A[leavecand[i]][col],
A[leavecand[i]][testcol], A[leavecand[0]][col]);
/* sign of A[l_0,t] / A[l_0,col] - A[l_i,t] / A[l_i,col] */
/* note only positive entries of entering column considered */
if (sgn==0) /* new ratio is the same as before */
leavecand[++newnum] = leavecand[i];
else if (sgn==1) /* new smaller ratio detected */
leavecand[newnum=0] = leavecand[i];
}
numcand = newnum+1;
}
else
/* testcol < 0: W(j) basic, Eliminate its row from leavecand */
/* since testcol is the jth unit column */
for (i=0; i < numcand; i++)
if (leavecand[i] == bascobas[W(j)])
{
leavecand[i] = leavecand[--numcand];
/* shuffling of leavecand allowed */
break;
}
} /* end of if(testcol != col) */
} /* end of for ( ... numcand > 1 ... ) */
*z0leave = (leavecand[0] == bascobas[Z(0)]);
return whichvar[leavecand[0]];
} /* end of lexminvar (col, *z0leave); */
/**
* Returns the leaving variable in VARS as entered by user.
* When enter in VARS is entering variable
* only nonzero entries of entering column admitted
* boolean *z0leave indicates back that z0 has been
* entered as leaving variable, and then
* the returned value is the index of z0.
*
* \param enter The entering variable
* \param z0leave Stores a boolean value stating if z0 can leave.
* \returns The leaving variable
*/
int interactivevar (int enter, int *z0leave)
{
char s[INFOSTRINGLENGTH], instring[2];
int inp, col, var;
int breject = 1;
assertcobasic(enter, "interactivevar");
col = TABCOL(enter);
vartoa(enter, s);
printf(" Entering variable (column): %s\n", s);
while (breject)
{
printf(" Leaving row (basic variable z.. or w..), ");
printf("or 't' for tableau:\n");
strcpy(instring, "?");
if (scanf("%1s", instring)==EOF)
{
printf ("Input terminated too early with EOF\n");
exit(1);
}
if ( instring[0] == 't')
{
printf("\n");
outtabl();
vartoa(enter, s);
printf(" Entering variable (column): %s\n", s);
continue;
}
scanf("%d", &inp);
printf(" You typed %s%d\n", instring, inp);
if ( (inp < 0) || (inp > n))
{
printf("Variable index %d outside 0..n=%d\n",
inp, n);
continue;
}
if ( instring[0] == 'w')
{
if (inp == 0)
{
printf("Variable w0 not allowed\n");
continue;
}
var = inp + n;
}
else if ( instring[0] == 'z')
var = inp;
else
{
printf("Variable not starting with z or w\n");
continue;
}
/* var == variable in VARS giving what has been input */
if ( bascobas[var] >= n)
{
vartoa (var, s);
printf("Variable %s not basic\n", s);
continue;
}
if ( zero( A [bascobas[var]] [col] ) )
{
vartoa (var, s);
printf("Row %s has zero pivot element, not allowed\n", s);
continue;
}
breject = 0; /* now everything ok */
} /* end of while (breject) for input */
*z0leave = (var == Z(0));
return var;
} /* end of interactivevar (col, *z0leave); */
/**
* Negates tableau column col
* \param col The column of the tableau to be negated.
*/
void negcol(int col)
{
int i;
for (i=0; i<n; i++)
changesign(A[i][col]);
}
/**
* Negate tableau row. Used in pivot().
* \param row The row of the tableau to be negated.
*/
void negrow(int row)
{
int j;
for (j=0; j<=n+1; j++)
if (!zero(A[row][j]))
changesign(A[row][j]);
}
/**
* Pivots the tableau given the entering and leaving variable.
* leave, enter in VARS defining row, col of A
* pivot tableau on the element A[row][col] which must be nonzero
* afterwards tableau normalized with positive determinant
* and updated tableau variables
*
* \param leave The leaving variable
* \param enter The entering variable
*/
void pivot (int leave, int enter)
{
int row, col, i, j;
int nonzero, negpiv;
mp pivelt, tmp1, tmp2;
row = bascobas[leave];
col = TABCOL(enter);
copy (pivelt, A[row][col]); /* pivelt anyhow later new determinant */
negpiv = negative (pivelt);
if (negpiv)
changesign(pivelt);
for (i=0; i<n; i++)
if (i != row) /* A[row][..] remains unchanged */
{
nonzero = !zero(A[i][col]);
for (j=0; j<=n+1; j++) /* assume here RHS==n+1 */
if (j != col)
/* A[i,j] =
(A[i,j] A[row,col] - A[i,col] A[row,j])/ det */
{
mulint (A[i][j], pivelt, tmp1);
if (nonzero)
{
mulint(A[i][col], A[row][j], tmp2);
linint(tmp1, 1, tmp2, negpiv ? 1 : -1);
}
divint (tmp1, det, A[i][j]);
}
/* row i has been dealt with, update A[i][col] safely */
if (nonzero && !negpiv)
changesign (A[i][col]);
} /* end of for (i=...) */
copy(A[row][col], det);
if (negpiv)
negrow(row);
copy(det, pivelt); /* by construction always positive */
/* update tableau variables */
bascobas[leave] = col+n; whichvar[col+n] = leave;
bascobas[enter] = row; whichvar[row] = enter;
} /* end of pivot (leave, enter) */
/**
* Returns the best response of a given strategy.
*
* \param l A players strategy such that 1 <= l <= m+n
* \returns The opponents best response strategy
*/
/* GSoC12: Tobenna Peter, Igwe */
int bestResponse(int l)
{
int m = 0;
if(l > nrows) /* if l is p2's strategy*/
{
l -= (nrows + 1);
int i;
for(i = 1; i < nrows; ++i)
{
if(ratgreat(payoffA[m][l], payoffA[i][l]))
m = i;
if(ratiseq(payoffA[m][l], payoffA[i][l]))
m = i;
}
m += 1;
}
else /* if l is p1's strategy */
{
int i;
l -= 1;
for(i = 1; i < ncols; ++i)
{
if(ratgreat(payoffB[l][m], payoffB[l][i]))
m = i;
if(ratiseq(payoffB[l][m], payoffB[l][i]))
m = i;
}
m += (nrows + 1);
}
return m;
}
/**
* Pivots the tableau given the values for the leaving
* and entering variables, and outputs data based on the
* flags.
*
* \param leave The leaving variable
* \param enter The entering variable
* \param flags The flags for running Lemke's algorithm
*/
/* GSoC12: Tobenna Peter, Igwe */
int fpivot(int leave, int enter, Flagsrunlemke flags)
{
testtablvars();
if (flags.bdocupivot)
{
if(docupivot (leave, enter, flags) < 0)
return -1;
}
pivot (leave, enter);
if (flags.bouttabl)
outtabl();
pivotcount++;
return 0;
}
/**
* Initialise the LH algorithm with the first