package org.uma.jmetal.problem;

import org.apache.commons.lang3.tuple.Pair;

import java.util.List;

/**
 * A {@link BoundedProblem} is a {@link Problem} for which solution boundaries
 * exist. Boundaries restrict each variable to be within an interval. This
 * interval may be different for each variable of the solution.
 * 
 * @author Matthieu Vergne <matthieu.vergne@gmail.com>
 *
 * @param <T>
 *          Type of boundary, typically {@link Integer} or {@link Double}
 * @param <S>
 *          Type of {@link Problem} solutions
 */
public interface BoundedProblem<T extends Number, S> extends Problem<S> {
  /**
   * @param index
   *          index of the variable
   * @return lower bound of the variable
   */
  T getLowerBound(int index);

  /**
   * @param index
   *          index of the variable
   * @return upper bound of the variable
   */
  T getUpperBound(int index);

  /**
   * @return A list with pairs <lower bound, upper bound> for each of the decision variables
   */
  List<Pair<T, T>> getBounds() ;
}

@@ -579,16 +579,32 @@
 s Number
+ & Comparable%3CT%3E
 , S%3E ext

Make bounds in BoundedProblem comparable