The LP problem - dual affine scaling

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.

Do you want to use the standard settings of the algorithmic parameters? For their meaning see the theory page

	Standard choice of algorithmic parameters	alpha=0.5, epsc=1.E-10, rho=2.3E-16 maxstep=100
	Your own choice:	alpha = alpha in [1.0e-9,2/3[ epsc = epsc > 1.0e-15 rho = rho > 2.2e-16 maxstep= maxstep <= 10000

Do you want to deal with the extended problem where an initial guess is trivially known?

	extended problem:	the penalty parameter big: big=
	Solve the problem directly	do you want to use y0=0? This is possible only if c(i)<0 for all i=1,...,n. y0=0 Input of a dual feasible value y Important: there must hold -c -ATy > 0!

Please specify the number ind of y-components which should appear in the iteration display (each three need a line):
ianz= Important: 1 <= ianz <= p resp. p+1 !

Please specify the ianz indices of these variables:
Important: 1 <= ykomp(i) <= p resp. p+1 !

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