The linear programming (LP) problem whose output follows determines how many necklaces (x1), bracelets (x2), rings (x3), and earrings (x4) a jewelry...

The linear programming (LP) problem whose output follows determines how many necklaces (x1), bracelets (x2), rings (x3), and earrings (x4) 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.