Integer Programmin
Local Optimum
A solution to a nonlinear programming problem with is better than any nearby point, but which may not be the global optimum.
Pure integer programming
cases in which all variables are required to have integer values
Mixed integer programming
cases in which some, but not all, of the decision variables are required to have integer values
Nonlinear Programming
A Category of mathematical programming techniques that allows the obj. function and /or constraints to be nonlinear.
Goal Programming
A mathematical programming technique that permits decision makers to set and prioritize multiple objectives.
An important concept about Integer Programming
Is that an integer programming solution can never be better than the solution to the same LP problem. The integer problem is usually worse off in terms of higher cost or lower profit.
Enumeration method
Listing all feasible solutions and selecting the one with the best objective function value. Can be quite tedious for even small problems and virtually impossible for large problems as the number of feasible integer solutions is extremely large.
0 - 1 Integer Programming
Problems in which all decision variables must have integer values of 0 or 1. This is also called binary variable.
Zero-one integer programming
Special cases in which all the decision variables must have integer solution of 0 or 1.
Deviational 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 obj. function.
Global Optimum
The overall best solution to a nonlinear programming problem.
Satisficing
The process of coming as close as possible to reaching your set of objectives.
Integer Programming
a mathematical programming techniques that produces integer solutions to linear programming problems.
integer programming
a model that has constraints and an objective function identical to that formulated by LP. The only difference is that one or more of the decision variables has to take on an integer value in the final solution. there are 3 types
