See also slides, optimization
Linearization around first order Taylor series expansions
Usage:
- Resource allocation
- Project selection
- Scheduling and Capital budgeting
- Energy network optimization
Criteria for optimization models
- comprised of only continuous variables
- linear objective function
- either only linear constraints or inequality constraints
where:
- : decision variables
- : cost coefficients of the decision variable
- : constraint coefficient for variable in constraint
- : coefficient for constraint
- : matrix of size
Sensitivity reports
Decision variables
Reduced cost: the amount of objective function will change if variable bounds are tighten
Allowable increase/decrease: how much objective coefficient must change before optimal solution changes.
100% Rule
If there are simultaneous changes to objective coefficients, and then the optimal solution would not change.
Constraints
Final value: the value of constraints at the optimal solution
Shadow price: of a constraint is the marginal improvement of the objective function value if the RHS is increased by 1 unit.
Allowable increase/decrease: how much the constraint can change before the shadow prices changes.
See lemon_orange.py