How to use

getValue

method

in

org.apache.commons.math.optimization.RealPointValuePair

  public int compare(final RealPointValuePair o1,
            final RealPointValuePair o2) {
    final double v1 = o1.getValue();
    final double v2 = o2.getValue();
    return (goalType == GoalType.MINIMIZE) ?
        Double.compare(v1, v2) : Double.compare(v2, v1);
  }
};

  public int compare(final RealPointValuePair o1, final RealPointValuePair o2) {
    if (o1 == null) {
      return (o2 == null) ? 0 : +1;
    } else if (o2 == null) {
      return -1;
    }
    final double v1 = o1.getValue();
    final double v2 = o2.getValue();
    return (goalType == GoalType.MINIMIZE) ?
        Double.compare(v1, v2) : Double.compare(v2, v1);
  }
});

  public int compare(final RealPointValuePair o1, final RealPointValuePair o2) {
    if (o1 == null) {
      return (o2 == null) ? 0 : +1;
    } else if (o2 == null) {
      return -1;
    }
    final double v1 = o1.getValue();
    final double v2 = o2.getValue();
    return (goalType == GoalType.MINIMIZE) ?
        Double.compare(v1, v2) : Double.compare(v2, v1);
  }
});

  public int compare(final RealPointValuePair o1, final RealPointValuePair o2) {
    if (o1 == null) {
      return (o2 == null) ? 0 : +1;
    } else if (o2 == null) {
      return -1;
    }
    final double v1 = o1.getValue();
    final double v2 = o2.getValue();
    return (goalType == GoalType.MINIMIZE) ?
        Double.compare(v1, v2) : Double.compare(v2, v1);
  }
});

  public int compare(final RealPointValuePair o1,
            final RealPointValuePair o2) {
    final double v1 = o1.getValue();
    final double v2 = o2.getValue();
    return (goalType == GoalType.MINIMIZE) ?
        Double.compare(v1, v2) : Double.compare(v2, v1);
  }
};

  public int compare(final RealPointValuePair o1, final RealPointValuePair o2) {
    if (o1 == null) {
      return (o2 == null) ? 0 : +1;
    } else if (o2 == null) {
      return -1;
    }
    final double v1 = o1.getValue();
    final double v2 = o2.getValue();
    return (goalType == GoalType.MINIMIZE) ?
        Double.compare(v1, v2) : Double.compare(v2, v1);
  }
});

/** {@inheritDoc} */
public boolean converged(final int iteration,
             final RealPointValuePair previous,
             final RealPointValuePair current) {
  final double p          = previous.getValue();
  final double c          = current.getValue();
  final double difference = Math.abs(p - c);
  final double size       = Math.max(Math.abs(p), Math.abs(c));
  return (difference <= (size * relativeThreshold)) || (difference <= absoluteThreshold);
}

  /** {@inheritDoc} */
  public boolean converged(final int iteration,
               final RealPointValuePair previous,
               final RealPointValuePair current) {
    final double p          = previous.getValue();
    final double c          = current.getValue();
    final double difference = FastMath.abs(p - c);
    final double size       = FastMath.max(FastMath.abs(p), FastMath.abs(c));
    return (difference <= (size * relativeThreshold)) || (difference <= absoluteThreshold);
  }
}

/** Evaluate all the non-evaluated points of the simplex.
 * @param comparator comparator to use to sort simplex vertices from best to worst
 * @exception FunctionEvaluationException if no value can be computed for the parameters
 * @exception OptimizationException if the maximal number of evaluations is exceeded
 */
protected void evaluateSimplex(final Comparator<RealPointValuePair> comparator)
  throws FunctionEvaluationException, OptimizationException {
  // evaluate the objective function at all non-evaluated simplex points
  for (int i = 0; i < simplex.length; ++i) {
    final RealPointValuePair vertex = simplex[i];
    final double[] point = vertex.getPointRef();
    if (Double.isNaN(vertex.getValue())) {
      simplex[i] = new RealPointValuePair(point, evaluate(point), false);
    }
  }
  // sort the simplex from best to worst
  Arrays.sort(simplex, comparator);
}

/** Evaluate all the non-evaluated points of the simplex.
 * @param comparator comparator to use to sort simplex vertices from best to worst
 * @exception FunctionEvaluationException if no value can be computed for the parameters
 * @exception OptimizationException if the maximal number of evaluations is exceeded
 */
protected void evaluateSimplex(final Comparator<RealPointValuePair> comparator)
  throws FunctionEvaluationException, OptimizationException {
  // evaluate the objective function at all non-evaluated simplex points
  for (int i = 0; i < simplex.length; ++i) {
    final RealPointValuePair vertex = simplex[i];
    final double[] point = vertex.getPointRef();
    if (Double.isNaN(vertex.getValue())) {
      simplex[i] = new RealPointValuePair(point, evaluate(point), false);
    }
  }
  // sort the simplex from best to worst
  Arrays.sort(simplex, comparator);
}

  public IValue llOptimize(IBool minimize, IBool nonNegative, ISet constraints, IConstructor f) {
    SimplexSolver solver = new SimplexSolver();
    ArrayList<LinearConstraint> constraintsJ =
        new ArrayList<LinearConstraint>(constraints.size());
    for(IValue v : constraints ){
      constraintsJ.add(convertConstraint((IConstructor)v));
    }
    LinearObjectiveFunction fJ = convertLinObjFun(f);
    GoalType goal = minimize.getValue() ? 
            GoalType.MINIMIZE : GoalType.MAXIMIZE;
    IValueFactory vf = values;
    boolean nonNegativeJ =  nonNegative.getValue();
    try {
      RealPointValuePair res = 
          solver.optimize(fJ, constraintsJ, goal,nonNegativeJ);
      return vf.constructor(Maybe_just, 
          vf.constructor(
              LLSolution_llSolution, convertToRealList(res.getPoint(), vf), 
              vf.real(res.getValue()) )
          );
    } catch (Exception e) {
      return  vf.constructor(Maybe_nothing); 
    }

  }
}