The simplex method is one way of solving a linear programming problem (LP-problem). An A* search algorithm based on a certain evaluation function has been developed to obtain the shortest path to an optimal solution within ...