Solve a Linear Problem

Assuming that you have already parsed a linear problem into the application's clipboard, if not please check how to parse a linear problem here. So having a linear problem stored in the applications's clipboard you can now proceed to the next step and solve it. Select from the menu bar Build > Solve or press the shortcut ctrl-s, the result of this process is to calculate the model of the solution of a linear problem, as you can see in the output area.

The solution model consists of parameter like the indicator adarap -1 for infeasible problems, 0 for optimal and 1 for unbounded, the zoptimal value as the optimal objective value, the xoptimal as the optimal solution, the feasibles[][] array as the feasible points, the infeasibles[][] array as the infeasible points, the ponrays[][] as the feasible points in case of an unbounded feasible region, the vertices[][] as the points defining the feasible region (polygon in 2D, polyhedron in 3D) and finally the rays[][] containing the minimum and maximum value of each variable.

Now you can proceed to emulate the process the Simplex algorithm follows in order to solve such a linear problem, see an example here.