Download Simplex Solver (Beta) APK latest version Free for Android
| Version | 0.2 |
| Update | 8 years ago |
| Size | 1.17 MB (1,226,760 bytes) |
| Developer | xSor |
| Category | Apps, Education |
| Package Name | bgb.com.simplexalgorithm |
| OS | 3.2 and up |
Simplex Solver (Beta) APPLICATION description
Simple tool for solving linear programming problems using the Simplex algorithm.
NOTE: This application is currently is in beta and is should not be expected to be fully functional.
Simplex solve is a simple tool for solving linear programming problems using the Simplex algorithm. The app features a matrix or equation input format for convenience.
Usage:
1. After putting the linear programming problem in standard form, first enter the number of variables and constraints.
2. Next, choose an input method (matrix or equation) and a solve mode to find the minimum or maximum.
3. Input the problem.
3a. Matrix Input:
For matrix input, simply enter the coefficients of the variables, where the top row is the objective function coefficients and the rest of the rows are for constraint inputs.
3b. Equation input:
Enter the objective function, in the following format: Ax0+Bx1+Cx2...MXn where A B C...M are the coefficients. If the coefficient is 0, simply enter, for example, 0x1. The variable names MUST be x0, x1, x2....xn.
4. Press the solve button to solve the problem. The minimum/maximum will be displayed as well as the optimal value.
Simplex solve is a simple tool for solving linear programming problems using the Simplex algorithm. The app features a matrix or equation input format for convenience.
Usage:
1. After putting the linear programming problem in standard form, first enter the number of variables and constraints.
2. Next, choose an input method (matrix or equation) and a solve mode to find the minimum or maximum.
3. Input the problem.
3a. Matrix Input:
For matrix input, simply enter the coefficients of the variables, where the top row is the objective function coefficients and the rest of the rows are for constraint inputs.
3b. Equation input:
Enter the objective function, in the following format: Ax0+Bx1+Cx2...MXn where A B C...M are the coefficients. If the coefficient is 0, simply enter, for example, 0x1. The variable names MUST be x0, x1, x2....xn.
4. Press the solve button to solve the problem. The minimum/maximum will be displayed as well as the optimal value.
↓ Read more
