Busy. Please wait.

show password
Forgot Password?

Don't have an account?  Sign up 

Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.
We do not share your email address with others. It is only used to allow you to reset your password. For details read our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
Don't know
remaining cards
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
restart all cards
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

Management Science

Management Science vocab

linear programming problem solving approach developed for situations involving max or min of a linear function
decision analysis used to determine optimal strategies in situations involving several decision alternatives
analog model does not have a physical appearance similar to real object or situation it represents
objective function mathematical expression that describes the problem's objective
decision variable controllable input
optimal solution specific decision-variable value or values that provide the "Best" output for the model
infeasible solution decision alternative that does not satisfy one or more constraints
breakeven point total revenue equals total cost
constraint equation that rules out certain combinations of decision variables as feasible solutions
sensitivity analysis study of how changes in the coefficients of a linear programming problem affect the optimal solution
dual price improvement in the value of the objective function per unit increase in the right-hand side of a constraint
reduced cost amount by which an objective function coefficient would have to improve before it would be possible for the corresponding variable to assume a positive value in the optimal solution
slack added to left-hand side of a less-than constraint to covert it to an equality (unused resource)
surplus subtracted from left-hand side of a greater-than constraint to convert it to an equality (amount above required minimum)
extreme point feasible solution points occurring at the corners of the feasible region
Created by: hnmead