Examlex
The following linear programming problem has been solved by The Management Scientist.Use the output to answer the questions.
LINEAR PROGRAMMING PROBLEM
MAX 25X1+30X2+15X3
S.T.
1)4X1+5X2+8X3<1200
2)9X1+15X2+3X3<1500
OPTIMAL SOLUTION
Objective Function Value = 4700.000 OBJECTIVE COEFFICIENT RANGES RIGHT HAND SIDE RANGES
a.Give the complete optimal solution.
b.Which constraints are binding?
c.What is the dual price for the second constraint? What interpretation does this have?
d.Over what range can the objective function coefficient of x2 vary before a new solution point becomes optimal?
e.By how much can the amount of resource 2 decrease before the dual price will change?f. What would happen if the first constraint's right-hand side increased by 700 and the second's decreased by 350?
Retrieval Cue
Stimuli or signals that can trigger the memory of a previous experience, making it easier to recall information.
Encoding Specificity Principle
The theory that memory is improved when information available at encoding is also present at retrieval.
Sensory Store
A very short-term form of memory that allows individuals to retain impressions of sensory information after the original stimuli have ended.
Retrieval Cue
A trigger or stimulus that aids the recall of information from memory.
Q6: For a minimization problem,a point is a
Q8: A statement that matches the values of
Q12: In quantitative analysis,the optimal solution is the
Q15: Revenue management methodology can be applied in
Q19: Sensitivity analysis for integer linear programming<br>A)can be
Q23: The standard form of a linear programming
Q23: Activities K,M and S immediately follow activity
Q28: Bayes' theorem provides a way to transform
Q30: To select a strategy in a two-person,zero-sum
Q50: The media selection model presented in the