Simplex implementation in Java with sample code
Simplex is one of the powerful algorithm to solve linear programming problems. With simplex, we can maximise or minimise objective function with the given list of constraint. public class Simplex { private double[][] tableaux; // tableaux private int numberOfConstraints; // number of constraints private int numberOfOriginalVariables; // number of original variables private boolean maximizeOrMinimize; private static final boolean MAXIMIZE = true; private static final boolean MINIMIZE = false; private int[] basis; // basis[i] = basic variable corresponding to row i public Simplex(double[][] tableaux, int numberOfConstraint, int numberOfOriginalVariable, boolean maximizeOrMinimize) { this.maximizeOrMinimize = maximizeOrMinimize; this.numberOfConstraints = numberOfConstraint; this.numberOfOriginalVariables = numberOfOriginalVariable; this.tableaux = tableaux; basis = new int[numberOfConstraints]; for (int i = 0; i <