Homework Helper

Not Rated (0)

$17/per page/

About Homework Helper

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Applied Sciences See all
Accounting,Applied Sciences,Art & Design,Chemistry,Economics,Essay writing Hide all
Teaching Since: Apr 2017
Last Sign in: 418 Weeks Ago, 4 Days Ago
Questions Answered: 3232
Tutorials Posted: 3232

Education

  • MBA,MCS,M.phil
    Devry University
    Jan-2008 - Jan-2011

  • MBA,MCS,M.Phil
    Devry University
    Feb-2000 - Jan-2004

Experience

  • Regional Manager
    Abercrombie & Fitch.
    Mar-2005 - Nov-2010

  • Regional Manager
    Abercrombie & Fitch.
    Jan-2005 - Jan-2008

Category > Business & Finance Posted 22 Jul 2017 My Price 9.00

A jewelry store makes necklaces and bracelets

A jewelry store makes necklaces and bracelets from gold and platinum. The store has developed the following linear programming model for determining the number of necklaces and bracelets (x1 and x2) to make in order to maximize profit:

Maximize Z = 300x1 + 400x2 (profit, $ )

subject to

3x1 + 22=18 (gold, oz)

2x1 + 4x2=20 (platinum, oz)

x2 =4 (demand, bracelets)
x 1, x2=0

  1. Solve this model graphically.
  2. The maximum demand for bracelets is 4. If the store produces the optimal number of bracelets and neck laces, will the maximum demand for bracelets be met? If not, by how much will it be missed?
  3. What profit for a necklace would result in no bracelets being produced, and what would be the optimal solution for this problem?

Answers

Homework Helper
Not Rated (0)
Status NEW Posted 22 Jul 2017 12:07 PM My Price 9.00

Hel-----------lo -----------Sir-----------/Ma-----------dam----------- T-----------han-----------k Y-----------ou -----------for----------- us-----------ing----------- ou-----------r w-----------ebs-----------ite----------- an-----------d a-----------cqu-----------isi-----------tio-----------n o-----------f m-----------y p-----------ost-----------ed -----------sol-----------uti-----------on.----------- Pl-----------eas-----------e p-----------ing----------- me----------- on----------- ch-----------at -----------I a-----------m o-----------nli-----------ne -----------or -----------inb-----------ox -----------me -----------a m-----------ess-----------age----------- I -----------wil-----------l

Not Rated(0)