code: public void toStandardForm(double[] originalC, double[][] originalG, double[] originalH,
  			double[][] originalA, double[] originalB, double[] originalLB, double[] originalUB) {
  		
  		this.F1 = (useSparsity)? DoubleFactory1D.sparse : DoubleFactory1D.dense;
  		this.F2 = (useSparsity)? DoubleFactory2D.sparse : DoubleFactory2D.dense;
  		
  		DoubleMatrix1D cVector = F1.make(originalC);
  		DoubleMatrix2D GMatrix = null;
  		DoubleMatrix1D hVector = null;
  		if(originalG!=null){
  			//GMatrix = (useSparsity)? new SparseDoubleMatrix2D(G) : F2.make(G);
  			GMatrix = F2.make(originalG);
  			hVector = F1.make(originalH);
  		}
  		DoubleMatrix2D AMatrix = null;
  		DoubleMatrix1D bVector = null;
  		if(originalA!=null){
  			//AMatrix = (useSparsity)? new SparseDoubleMatrix2D(A) : F2.make(A);
  			AMatrix = F2.make(originalA);
  			bVector = F1.make(originalB);
  		}
  		if(originalLB != null && originalUB !=null){
  			if(originalLB.length != originalUB.length){
  				throw new IllegalArgumentException("lower and upper bounds have different lenght");
  			}
  		}
  		DoubleMatrix1D lbVector = (originalLB!=null)? F1.make(originalLB) : null;
  		DoubleMatrix1D ubVector = (originalUB!=null)? F1.make(originalUB) : null;
  		
  		toStandardForm(cVector, GMatrix, hVector, AMatrix, bVector, lbVector, ubVector);
  	}
docs: Transforms the problem from a general form to the (quasi) standard LP form.
  
  @param originalLB if null, all lower bounds default to this.unspecifiedLBValue
  @param originalUB if null, all upper bounds default to this.unspecifiedUBValue
  
  @see Converting LPs to standard form, "Convex Optimization", p 147