CAP Optimization Flashcards
Objective function
a function that maps an event or values of one or more variables onto a real number intuitively representing some cost or benefit associated with the event
Sensitivity analysis
Method for investigating how the optimal solution to an optimization problem changes as constraints are relaxed
Feasible region
the set of all possible points of an optimization problem that satisfy the problem’s constraints
Graphical method
a simple method for solving optimization problems involving two decision variables by drawing the many constraints
Non Linear Optimization
the process of solving an optimization problem defined by a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized, where some of the constraints or the objective function are nonlinear
Integer programming
a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers
Tabu search
a metaheuristic search method employing local search methods used for mathematical optimization
Mixed linear programming
a mathematical optimization or feasibility program in which some, but not all, all of the variables are restricted to be integers
Goal programming
a branch of multiobjective optimization, which in turn is a branch of multi-criteria decision analysis; an extension or generalisation of linear programming to handle multiple, normally conflicting objective measures
Simulation-based optimization
An integration of optimization techniques into simulation analysis; used when the objective function is difficult and expensive to evaluate because of the complexity of the simulation
Linear programming
a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships
Constraint
a condition of an optimization problem that the solution must satisfy
Shadow price
the instantaneous change, per unit of the constraint, in the objective value of the optimal solution of an optimization problem obtained by relaxing the constraint.
Duality
the principle that optimization problems may be viewed from either of two perspectives, maximization or minimization
genetic algorithm
a search heuristic that mimics the process of natural selection
