Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 442 Weeks Ago, 4 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Computer Science Posted 29 Apr 2017 My Price 3.00

Formulate an integer programming model for this problem.

22.              The artisans at Jewelry Junction in Phoenix are preparing to make gold jewelry during a 2-month pe- riod for the Christmas season. They can make bracelets, necklaces, and pins. Each bracelet requires

6.3 ounces of gold and 17 hours of labor, each necklace requires 3.9 ounces of gold and 10 hours of labor, and each pin requires 3.1 ounces of gold and 7 hours of labor. Jewelry Junction has available 125 ounces of gold and 320 hours of labor. A bracelet sells for $1,650, a necklace for $850, and a pin for $790. The store wants to know how many of each item to produce to maximize revenue.

1.                  Formulate an integer programming model for this problem.

2.                  Solve this model by using the computer. Compare this solution with the solution with the in- teger restrictions relaxed and indicate whether the rounded-down solution would have been optimal.

 

 

Answers

Alpha Geek
(8)
Status NEW Posted 29 Apr 2017 06:04 AM My Price 3.00

-----------

Attachments

file 1493448887-1262747_1_636289797759722152_Q1.xlsx preview (38 words )
br-----------ace-----------let-----------sne-----------ckl-----------ace-----------spi-----------nso-----------unc-----------es -----------of -----------gol-----------d p-----------er -----------Uni-----------tLa-----------bou-----------r H-----------r p-----------er -----------Uni-----------tTo-----------tal----------- Av-----------ail-----------abl-----------eSe-----------lli-----------ng -----------Pri-----------ceo-----------unc-----------es -----------of -----------gol-----------d r-----------equ-----------ire-----------dLa-----------bou-----------r H-----------r r-----------equ-----------ire-----------dPr-----------odu-----------cti-----------onD-----------eci-----------sio-----------n V-----------ari-----------abl-----------esC-----------ons-----------tra-----------int-----------sOb-----------jec-----------tiv-----------e F-----------unc-----------tio-----------nIn-----------teg-----------er -----------Res-----------tri-----------cte-----------d L-----------ine-----------ar -----------Pro-----------gra-----------mmi-----------ngI-----------nte-----------ger----------- Re-----------str-----------ict-----------ed -----------Rel-----------axe-----------d L-----------ine-----------ar -----------Pro-----------gra-----------mmi-----------ngA-----------. T-----------ota-----------l S-----------ell-----------ing----------- (i-----------nte-----------ger----------- re-----------str-----------ict-----------ed)-----------B. -----------Tot-----------al -----------Sel-----------lin-----------g (-----------int-----------ege-----------r r-----------ela-----------xed-----------)Si-----------nce-----------, B-----------&am-----------p;g-----------t;A-----------, i-----------nte-----------ger----------- re-----------lax-----------ed -----------giv-----------es -----------opt-----------ima-----------l s-----------olu-----------tio-----------n -----------
Not Rated(0)