Index

A

acyclic, [1] adjacency matrix

affine function Aggregate production planning arcs

B

backlog basic feasible solution basic solution basis binary classification

binary knapsack Blending aluminum scrap, [1], [2] Bottleneck Assignment bounding Branch & Bound Branch & Cut, [1]

C

capacity chain chance constraint chase Chinese postman problem Choosing among different production modes classification clause complementarity concave function, [1] Concorde

Conditional Value at Risk conductance connected continuous relaxation convex function, [1] convex hull convex optimization, [1] convex set, [1] covering critical path cuts cutting stock problems

D

Data Envelopment Analysis DEA, [1] Deciding road direction in urban networks decision variables, [1], [2] destination Determination of the karyotype of chromosomes deterministic strategy di-graphs diet problem

difference of potential directed cycle directed graphs disjunctive disjunctive normal form downside risk dual duality duality theory

E

edge, [1] efficient frontier efficient portfolios eigenvalues

euclidean ball expected return extension of the cover inequality extremes

F

Fair assignment feasible set, [1], [2], [3]

feasible solution features Flow conservation

G

Gantt chart global optimum, [1]

goal programming graph, [1]

H

Hamiltonian path

Horn clauses

I

ideal ILO ILP in-degree

incidence matrix, [1], [2] incident infeasible Integer Linear Optimization inventory balance equation

K

kernels

knapsack

L

label level lifted inequalities linear optimization linear function linear model, [1], [2] linear optimization model, [1], [2] linearly separable

literal local optimum local minimum local optimum Localization of emergency facilities Logical constraints in a blend loop lot sizing

M

makespan Manhattan distance margin Master Production Scheduling Maximum reliability path, [1] MILO MILP

minimum cost flow minimum cost path Minimum resistance path in an electrical network Mixed Integer Linear Optimization model MPS Multi period financial planning multi-class classification multi-commodity flow

N

network flow nodes

non cooperative zero-sum games non dominated normal conjunctive form

O

objective function, [1], [2] objective function optimal solution optimal value

optimization problem oriented paths origin out-degree

P

packing Pareto partitioning path payoff matrix polyhedron, [1], [2] positive definite positive-semidefinite

potentials power set probability distribution function Production and distribution production mix Project planning Project Planning with incompatible resources Purchase planning for a canteen pure strategy

R

random variable recourse actions regression, [1]

relaxation resistance return risky assets

S

Safe evacuation from a building School bus driver assignment section semi-variance separation procedure Sequencing in industrial production sequencing problem series production models set covering Set Covering approach to Vehicle routing set packing set partitioning

Shift planning Shift/staff matching simplex method source standard linear optimization startup cost Stochastic farm planning strategy strong duality theorem stronger formulation strongly connected sub-tours Support Vector Machines

T

tension terminal time windows total unimodularity

Tracking of moving objects Transport of electricity traveling salesperson tree TSP

U

unbounded

V

value Value at Risk

Vehicle routing vertices

W

Wagner-Within

walk weak duality theorem

Z

Zero-sum games