Class 8 Flashcards
Define: Decision variable
amounts of either inputs or outputs
Define: Objective function
mathematical statement of profit, cost, etc
Define: Constraint
limitations that restrict the available alternative
Define Parameter
give fixed model values for the set of feasible combinations of decision variables defined by the constraints
Define Redundant constraint
a constraint that does not form a unique boundary of the feasible solution space. By defin
Define: Binding constraint
a constraint that forms the optimal corner point of the feasible solution space. Not all of the constraints that define the feasible solution space will form the optimal corner point
Define: slack
when the optimal values of decision variables are substituted into less than or equal to constraint and the resulting values is less than the right side value (less than constraint)
Define: surplus
when the optimal values of decision variables are subtituted into a greater than or equal to constraint and the resulting value exceeds the right side value (greater than constraint)
Define sensitivity analysis
a means for assessing the impact of potential changes to the numerical values of an LP Model
Define range of optimality
the range of values for an objective funstion over which the solution values of the decision variables remain the same
Define RHS value
changes in right hand values of constraints
Define Shadow price
the amount by which the value of the objective function would change if there were a one-unit change in the RHS value of a constraint
Define Range of feasibility
the range of values for the RHS of a constraint over which the shadow price remains the same
List the 4 assumptions of linear programming
1) Linearity - impact of decision variables is linear in both the constraints and the objective function
2) Divisibility - non integer values of decision variables are acceptable
3) Certainty - values of parameters are known and constant
4) Non negativity - negatives values of decision variables are unacceptable
8 steps in graphical solution methods for finding optimal solution to two variable problems
1) set up the objective function and constraints in a mathematical format
2) Plot the constraints
3) Identify the feasible solution space
4) Plot the objective function
5) Identify redundant constraints
6) Identify the solution and corner points
7) Minimization
8) Slack and surplus