Essay
The LP problem whose output follows determines how many necklaces,bracelets,rings,and earrings a jewelry store should stock.The objective function measures profit; it is assumed that every piece stocked will be sold.Constraint 1 measures display space in units,constraint 2 measures time to set up the display in minutes.Constraints 3 and 4 are marketing restrictions.
LINEAR PROGRAMMING PROBLEM
MAX 100X1+120X2+150X3+125X4
S.T.
1)X1+2X2+2X3+2X4<108
2)3X1+5X2+X4<120
3)X1+X3<25
4)X2+X3+X4>50
OPTIMAL SOLUTION
Objective Function Value = 7475.000 OBJECTIVE COEFFICIENT RANGES RIGHT HAND SIDE RANGES Use the output to answer the questions.
a.How many necklaces should be stocked?
b.Now many bracelets should be stocked?
c.How many rings should be stocked?
d.How many earrings should be stocked?
e.How much space will be left unused?f. How much time will be used?g. By how much will the second marketing restriction be exceeded?
Correct Answer:

Verified
a.8
b.0
c.17
d.33
e.0
f.57
g.0...View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Correct Answer:
Verified
b.0
c.17
d.33
e.0
f.57
g.0...
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q15: How is sensitivity analysis used in linear
Q17: To solve a linear programming problem with
Q25: For a minimization problem,a positive dual price
Q40: Excel's Solver tool has been used
Q40: The dual price associated with a constraint
Q41: Use the spreadsheet and Solver sensitivity report
Q44: There is a dual price for every
Q46: LINGO output is given for the
Q47: The 100% Rule compares<br>A) proposed changes to
Q50: Consider the following linear program:<br>