Term
| What is Linear Programming (LP)? |
|
Definition
| LP is an approach to analysis of constrained optimization problems |
|
|
Term
| what is the goal of linear programming? |
|
Definition
| the goal of linear programming is to compute the values of some decision variables or activities |
|
|
Term
| What are names and corresponding notation associated with an LP? |
|
Definition
Z is the objective variable
c_i is the objective function coefficients for the n variables
a_{i,j} are the constraint coefficients for the m constraints
b_j are the right-hand sides for the constraints |
|
|
Term
| What are the Assumptions underlying LP? |
|
Definition
Proportionality [for each activity (i) the contribution to the objective fn (c_i) and each constraint (a_{i,j}) is he same]
Additivitiy [contributions to the objective and constraints of activity dont affect contributions of another]
Divisibility [any continuous level for activity is feasible; -- activity levels dont have to be whole #s]
Certainty [all parameters are known -- nothing in prob is random] |
|
|
