org.apache.commons.math.optimization.linear.LinearOptimizer Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of commons-math Show documentation

The Math project is a library of lightweight, self-contained mathematics and statistics components addressing the most common practical problems not immediately available in the Java programming language or commons-lang.

The newest version!

/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.apache.commons.math.optimization.linear;

import java.util.Collection;

import org.apache.commons.math.optimization.GoalType;
import org.apache.commons.math.optimization.OptimizationException;
import org.apache.commons.math.optimization.RealPointValuePair;

/**
 * This interface represents an optimization algorithm for linear problems.
 * Optimization algorithms find the input point set that either {@link GoalType
 * maximize or minimize} an objective function. In the linear case the form of
 * the function is restricted to
 * 
 * c₁x₁ + ... c_nx_n = v
 * 
 * and there may be linear constraints too, of one of the forms:
 * 
 *   c₁x₁ + ... c_nx_n = v
 *   c₁x₁ + ... c_nx_n <= v
 *   c₁x₁ + ... c_nx_n >= v
 *   l₁x₁ + ... l_nx_n + l_cst =
 *       r₁x₁ + ... r_nx_n + r_cst
 *   l₁x₁ + ... l_nx_n + l_cst <=
 *       r₁x₁ + ... r_nx_n + r_cst
 *   l₁x₁ + ... l_nx_n + l_cst >=
 *       r₁x₁ + ... r_nx_n + r_cst
 * 
 * where the c_i, l_i or r_i are the coefficients of
 * the constraints, the x_i are the coordinates of the current point and
 * v is the value of the constraint.
 * 
 * @version $Revision: 811685 $ $Date: 2009-09-05 19:36:48 +0200 (sam. 05 sept. 2009) $
 * @since 2.0
 */
public interface LinearOptimizer {

    /** Set the maximal number of iterations of the algorithm.
     * @param maxIterations maximal number of function calls
     */
    void setMaxIterations(int maxIterations);

    /** Get the maximal number of iterations of the algorithm.
     * @return maximal number of iterations
     */
    int getMaxIterations();

    /** Get the number of iterations realized by the algorithm.
     * 
     * The number of evaluations corresponds to the last call to the
     * {@link #optimize(LinearObjectiveFunction, Collection, GoalType, boolean) optimize}
     * method. It is 0 if the method has not been called yet.
     * 
     * @return number of iterations
     */
    int getIterations();

    /** Optimizes an objective function.
     * @param f linear objective function
     * @param constraints linear constraints
     * @param goalType type of optimization goal: either {@link GoalType#MAXIMIZE}
     * or {@link GoalType#MINIMIZE}
     * @param restrictToNonNegative whether to restrict the variables to non-negative values
     * @return point/value pair giving the optimal value for objective function
     * @exception OptimizationException if no solution fulfilling the constraints
     * can be found in the allowed number of iterations
     */
   RealPointValuePair optimize(LinearObjectiveFunction f, Collection constraints,
                               GoalType goalType, boolean restrictToNonNegative)
        throws OptimizationException;

}