| Class and Description |
|---|
| IPProblem
An Integer Programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
\[
\min_x f(x) \textrm{ s.t.,} \\
h_i(x) = 0 \\
g_i(x) \leq 0
\]
Some {xi} are integers.
|
| Class and Description |
|---|
| IPMinimizer
An Integer Programming minimizer minimizes an objective function subject to equality/inequality
constraints as well as integral constraints.
|
| IPProblem
An Integer Programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
\[
\min_x f(x) \textrm{ s.t.,} \\
h_i(x) = 0 \\
g_i(x) \leq 0
\]
Some {xi} are integers.
|
| IPProblemImpl1
This is an implementation of a general Integer Programming problem in which some variables take only integers.
|
| Class and Description |
|---|
| IPMinimizer
An Integer Programming minimizer minimizes an objective function subject to equality/inequality
constraints as well as integral constraints.
|
| Class and Description |
|---|
| IPProblem
An Integer Programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
\[
\min_x f(x) \textrm{ s.t.,} \\
h_i(x) = 0 \\
g_i(x) \leq 0
\]
Some {xi} are integers.
|
| Class and Description |
|---|
| IPProblem
An Integer Programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
\[
\min_x f(x) \textrm{ s.t.,} \\
h_i(x) = 0 \\
g_i(x) \leq 0
\]
Some {xi} are integers.
|
Copyright © 2010-2026 NM Group. All Rights Reserved.