以前学运筹学写的作业，单纯形法（纯C实现）

#include <stdio.h>

#define N 5

#define M 3

int max(int x, int y)

{

         if(x>y)

                   return(x);

         else

                   return(y);

}

int min(int x, int y)

{

         if(x<y)

                   return(x);

         else

                   return(y);

}

int main()

{

         inti, j, p, m, n, k, l, r, u, v, t, X[M];

         float  z = 0, d[N], f[M], s[N], g[M];

 

         for(i = 0; i < M; i++)

                   X[i] = i + 1 + N - M;

         floatc[N] = { 2, 3, 0, 0, 0}, e[M] = { 12, 16, 15 },

                   a[M][N] =

         { { 2, 2, 1, 0, 0 },

         { 4, 0, 0, 1, 0 },

         { 0, 5, 0, 0, 1 } };

         for(i = 0; i < M; i++)

                   g[i] = c[N - M + i];

         for(j = 0; j < N; j++)

         {

                   p = 0;

                   for (i = 0; i < M