simplex.c

#include "Simplex_aux.h"

int main(){
    int status;
    MatrixSystem system;
    Base *base;
    double *costs, *basicSolution, *solution;
    getSimplexSystem(&system, &costs);
    basicSolution = (double*)malloc(system.size * sizeof(double));
    solution = (double*)malloc(system.columns * sizeof(double));
    if(solution == NULL || basicSolution == NULL){
        printf("Erro de alocação de memória.\n");
        exit -1;
    }
    base = getBase(system, basicSolution);
    if(base == NULL)
        printf("Problema infactível.\n");
    else{
        status = simplexMethod(base, basicSolution, costs);
        switch (status){
        case 1:          
            for (int i = 0; i < system.columns; i++){
                if(i < system.size)
                    solution[base->basicPartition[i]] = basicSolution[i];
                else
                    solution[base->nonBasicPartition[i - system.size]] = 0;
            }
            printf("Solução do problema: ");
            for (int i = 0; i < system.columns; i++)
                printf("%lf ", solution[i]);

            printf("\nValor ótimo da solução: f(x) = %lf\n", dotProduct(costs, solution, system.columns));
            
            break;
        case 0:
            printf("O problema possui solução ilimitada.\n");
            break;
        }

        freeBase(base);
        base = NULL;
    }
    system.size = system.columns;
    freeMatrixSystem(system);
    free(costs);
    costs == NULL;
    free(solution);
    solution = NULL;
    free(basicSolution);
    basicSolution = NULL;
    free(solution);
    solution = NULL;

    return 0;
}