Problems in which all decision variables must have integer values of 0 or 1. These variables are also called binary variables.
Terms that are minimized in a goal programming problem. Like slack variables in LP, they are real. They are the only terms in the objective function.
The overall best solution to a nonlinear programming problem.
A mathematical programming technique that permits decision makers to set and prioritize multiple objectives.
A mathematical programming technique that produces integer solutions to linear programming problems.
A solution to a nonlinear programming problem that is better than any nearby point, but that may not be the global optimum.
A category of mathematical programming techniques that allows the objective function and/or constraints to be nonlinear.
The process of coming as close as possible to reaching your set of objectives.