com.numericalmethod.suanshu.optimization.constrained.integer.linear.problem

Class PureILPProblem

java.lang.Object

com.numericalmethod.suanshu.optimization.constrained.integer.linear.problem.ILPProblemImpl1

com.numericalmethod.suanshu.optimization.constrained.integer.linear.problem.PureILPProblem

All Implemented Interfaces:

LPProblem, IPProblem, ILPProblem, ConstrainedOptimProblem, OptimProblem, java.io.Serializable

public class PureILPProblem
extends ILPProblemImpl1

This is a pure integer linear programming problem, in which all variables are integral.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
PureILPProblem(Vector cost, LinearGreaterThanConstraints greater, LinearLessThanConstraints less, LinearEqualityConstraints equal, BoxConstraints bounds, double epsilon) Construct a pure ILP problem.

Method Summary

Methods inherited from class com.numericalmethod.suanshu.optimization.constrained.integer.linear.problem.ILPProblemImpl1

A, Aeq, b, beq, c, dimension, epsilon, f, getEqualityConstraints, getIntegerIndices, getLessThanConstraints, getNonIntegralIndices, isFree

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

PureILPProblem

public PureILPProblem(Vector cost,
                      LinearGreaterThanConstraints greater,
                      LinearLessThanConstraints less,
                      LinearEqualityConstraints equal,
                      BoxConstraints bounds,
                      double epsilon)

Construct a pure ILP problem.

Parameters:

cost - the linear objective function

greater - the greater-than-or-equal-to constraints

less - the less-than-or-equal-to constraints

equal - the equality constraints

bounds - the box constraints

epsilon - a precision parameter: when a number |x| ≤ ε, it is considered 0