The LP problem - dual affine scaling - sparse matrix input

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 specify here the nonzero coefficients of the objective function and the equation's right hand side in these two textareas. Input form is index,value rowwise
For example
1, 6
2, 0.4
5, 0.3   
for c(1)=6, c(2)=0.4 und c(5)=0.3
Other entries are initialized by zero.

objective function coefficients c:		equations right hand side b:

Please type the nonzero matrix entries a(i,j) (matrix A) in the following textarea:
Important : input form is index1, index2, value rowwise !
For example
1, 1, 6
2, 1, 0.4
5, 1, 0.3
5, 6, 1.3   
for a(1,1)=6, a(2,1)=0.4, a(5,1)=0.3 and a(5,6)=1.3
other entries are initialized by zero.

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.