Simplex algorithm for solving constrained linear p
no vote
Application background Realize the simplex algorithm for solving constrained standard linear programming problem, according to the input of the objective function and the constraint conditions to solution to meet the constraints of the optimal solution and the objective function of the maximum value. Key Technology Selecting the base variable, selecting the base variable, the variable of the axis of the shaft, the input variables Float matrix[100][100], x[100]; /* record the total array equation, solution of the array * /Int a[100]; /* record based, non based solutions, 0: based, 1: based * /Int m, N, s, type; /* variable equation, the number of constraints, for the type of maximum and minimum value, the minimum   0: 1: maximum; * /Int , indexe, indexl, indexg,  , /* ,,,  , */