Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 41 views

    Delettt

    Uploaded by

    ming li
    This C code implements the simplex method for solving linear programming problems. It includes functions to input the constraint coefficients and objective function, find entering and leaving variables, perform a pivot operation, and print the simplex table at each iteration. The main function calls the other functions in a loop to iteratively solve the problem until an optimal solution is found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    Delettt

    Uploaded by

    ming li
    41 views4 pages
    This C code implements the simplex method for solving linear programming problems. It includes functions to input the constraint coefficients and objective function, find entering and leaving variables, perform a pivot operation, and print the simplex table at each iteration. The main function calls the other functions in a loop to iteratively solve the problem until an optimal solution is found.

    Original Description:

    delett

    Original Title

    delettt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This C code implements the simplex method for solving linear programming problems. It includes functions to input the constraint coefficients and objective function, find entering and leaving variables, perform a pivot operation, and print the simplex table at each iteration. The main function calls the other functions in a loop to iteratively solve the problem until an optimal solution is found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    41 views4 pages

    Delettt

    Uploaded by

    ming li
    This C code implements the simplex method for solving linear programming problems. It includes functions to input the constraint coefficients and objective function, find entering and leaving variables, perform a pivot operation, and print the simplex table at each iteration. The main function calls the other functions in a loop to iteratively solve the problem until an optimal solution is found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    of 4

    #include <stdio.

    h>
    #include <math.h>
    #pragma warning(disable:4996)
    #define m 5 //定义约束方程个数
    #define n 12 //定义决策变量个数
    double M = 13e5;
    double A[m][n];
    double C[n];
    double b[m];
    double CB[m];
    double seta[m];
    double sigma[n];
    double x[n];
    int num[m];
    double Z = 0;
    void input();
    void print();
    int FindSwapInVar();
    int FindSwapOutVar(int a);
    void Iterate(int a, int b);

    int FindSwapInVar()
    {
    int i, k = 0;
    int flag = 1;
    double min = 0;
    for (i = 0; i < n; i++)
    {
    if (sigma[i] < 0)
    {
    flag = 0; break;
    }
    }
    if (flag == 1)
    return -1;
    for (i = 0; i < n; i++)
    {if (sigma[i] < min)
    {
    min = sigma[i];
    k = i;
    }
    }
    return k;
    }

    int FindSwapOutVar(int a)
    {
    int i, j;
    int flag = 1;
    int k = a;
    for (i = 0; i < m; i++)
    {
    if (A[i][k] > 0)
    {
    flag = 0; break;
    }
    }
    if (flag == 1)
    {
    printf("nmnnj\n");
    return -1;
    }
    for (i = 0; i < m; i++)
    {
    if (A[i][k] > 0)
    seta[i] = b[i] / A[i][k];
    else seta[i] = M
    }
    double min = M;
    for (i = 0; i < m; i++)
    {
    if (min >= seta[i])
    {
    min = seta[i];
    j = i;
    }

    }
    num[j] = k + 1;
    CB[j] = C[k];
    return j;
    }

    void Iterate(int p, int q)


    {
    int i, j, r, c;
    r = p;
    c = q;
    double temp1 = A[r][c];
    double temp2, temp3;
    b[r] /= temp1;
    for (j = 0; j < n; j++)
    A[r][j] /= temp1;
    for (i = 0; i < m; i++)
    {
    if (i != r)
    if (A[i][c] != 0)
    {
    temp2 = A[i][c];
    b[i] -= temp2 * b[r];//b[r]转轴元对应 b
    for (j = 0; j < n; j++)
    A[i][j] -= temp2 * A[r][j];
    }
    }

    temp3 = sigma[c];
    for (i = 0; i < n; i++)
    {
    sigma[i] -= A[r][i] * temp3;
    }

    }
    void input()
    {
    int i, j;
    printf("\n", m, n);
    for (i = 0; i < m; i++)
    for (j = 0; j < n; j++)
    scanf("%lf", &A[i][j]);
    printf("\n");
    for (i = 0; i < m; i++)
    scanf("%d", &num[i]);
    printf("\n");
    for (i = 0; i < m; i++)
    scanf("%lf", &b[i]);
    printf("\n");
    for (i = 0; i < n; i++)
    scanf("%lf", &C[i]);
    for (i = 0; i < n; i++) {
    sigma[i] = C[i];
    for (j = 0; j < n; j++) {
    sigma[i] = sigma[i] - A[j][i] * C[num[j]];
    }
    }
    for (i = 0; i < m; i++)
    CB[i] = C[num[i]];
    }

    void print()
    {
    int i, j;
    printf("\
    n----------------------------------------------------------------------------------
    ----------------------------------\n");
    for (i = 0; i < m; i++)
    {
    printf("%8.2f\tX(%d) %8.2f ", CB[i], num[i], b[i]);
    for (j = 0; j < n; j++)
    printf("%8.2f ", A[i][j]);
    if (i != m - 1)
    printf("\n");
    }
    printf("\
    n----------------------------------------------------------------------------------
    ----------------------------------\n");
    printf("\t\t σ ");
    for (i = 0; i < n; i++)
    {
    printf(" %8.2f", sigma[i]);
    }
    printf("\
    n----------------------------------------------------------------------------------
    ----------------------------------\n");
    }

    int main()
    {
    int i, j, k = 1;
    int p, q;
    input();
    printf("\
    n--------------------------------------------------------------------------\n");
    printf("\tCB\tXB\tb\t");
    for (i = 0; i < n; i++)
    printf(" X(%d)\t", i + 1);
    for (i = 0; i < n; i++)
    x[i] = 0;
    while (1)
    {
    q = FindSwapInVar();
    if (q == -1)
    {
    print();
    printf("\n\n");
    printf("");
    for (j = 0; j < m; j++)
    x[num[j] - 1] = b[j];
    for (i = 0; i < n; i++)
    {
    printf("x%d=%.2f ", i + 1, x[i]);
    Z = Z + x[i] * C[i];
    }
    printf("\n 最优值为：Z* = %.2f", Z);
    break;
    }
    print();
    p = FindSwapOutVar(q);
    printf("\n(%d,%d)\n", k++, p + 1, q + 1);
    if (q == -1) break;
    Iterate(p, q);
    }
    }

    You might also like