LP problem - Simplex method -- dense matrix

Please specify a problem identifier in this field (no blanks included)

Please specify the dimension n (n=dim(x)=dim(c)):
n= Important : 1 <= n <= 99 !

Please specify the number p of rows of the matrix A:
p= Important : 1 <= p <= n-1 !

Please type the coefficients of the objective function c(1),...,c(n) in this text area:
n numbers followed by blank or comma, format free -1.0, 2.0, -9.1, 1.0, 0.0

Please type the coefficients of the linear equations in the following field, i.e. a(i,j),..,b(i) rowwise:
hence n+1 entries
For example 1,2,3,6   for 1x₁+2x₂+3x₃ = 6
Each of the p rows must begin on a new input line, but may itself extend over several input lines. Input is format free, numbers separated by blank or comma.

Should phase 1 be included? (requires n+p <= 99 !)

	with phase 1
	start with feasible vertex	type basis of this vertex here :basis(i),i=1,..,p (integer) feasibility will be checked!.

Rule for selecting the incoming variable: most negative reduced cost or the least index rule of Bland?

	most negative multiplier (max dual violation)
	least index rule

For safety: the maximum number of exchange steps maxstep:
maxstep= Important: n <= maxstep <= 10000 !

Do you want to see the intermediate tableaus?

	Display the condensed tableau
	no output of the tableau

Click on "evaluate", in order to submit your input.