Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

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

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 398 Weeks Ago, 4 Days Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 12 Sep 2017 My Price 5.00

Muncie, Indiana

Ken Stark is an operations analyst for an insurance company in Muncie, Indiana. Over the next 6 weeks, the company needs to send 2,028,415 pieces of marketing literature to customers in the following 16 states:

 

In order to coordinate with other marketing efforts, all the mailings for a given state must go out the same week (that is, if Ken decides to schedule mailings for Georgia in week 2, then all of the 136,562 pieces of mail for Georgia must be sent that week). Ken would like to balance the workload in each week as much as possible and, in particular, would like to minimize the maximum amount of mail to be processed in any given week during the 6-week period.

a. Create a spreadsheet model to determine which states should be processed each week in order to achieve Ken’s objective.

b. What is the optimal solution?

 

Answers

Maurice Tutor
(5)
Status NEW Posted 12 Sep 2017 10:09 PM My Price 5.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)