Please define all these terms. It will help with test $1.$

Please submit your definitions to be graded as a homework $($mostly on completion$).$

Types of Problems $($From Homework $1)$

Knapsack problem

Diet problem

Facility location problem

Production planning problem

Vehicle routing problem

Transportation problem

Transshipment problem

Set covering problem

General Terms

Constraint

Feasible Region

Objective Function

Decision Variable

Upper Bound

Parameters

Solver Methods

Simplex Method

Simplex Pivot

Branch and Bound

Genetic Algorithm

Simulated Annealing

Linear Programming

Dual Problem

Dual Variable

Slack Variable

Artificial Solution

CPLEX

Dynamic Programming

Integer Programming

Non$-$Linear Programming

Linear Programming

Shadow price

Sensitivy analysis

Branch and Cut $($IP$)$