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 27 Jul 2017 My Price 11.00

number of supercomputers

1. The IRS has determined that during each of the next six months it will need the number of supercomputers given in the table below. To meet these requirements, the IRS rents supercomputers for a period of one, two, or three months. It costs $100 to rent a supercomputer for one month, $180 for two months, and $250 for three months. At the beginning of month 1, the IRS has no supercomputers. Determine the rental plan that meets the requirements at minimum cost. Note: You may assume that fractional rentals are okay. Use the Simplex (or Two Phase Simplex) method. You can implement this method in Excel but I am not asking you to use Excel’s solver.

Month

1

2

3

4

Computer requirements

800

600

500

600

2. Carco has a $150,000 advertising budget. To increase automobile sales, the firm is considering advertising in newspapers and on television. The more Carco uses a particular medium, the less effective is each additional ad. The table below shows the number of new customers reached by each ad. Each newspaper ad costs $1,000, and each television ad costs $9,000. At most, 30 newspaper ads and 15 television ads can be placed. How can Carco maximize the number of new customers created by advertising? First formulate the problem then solve it with Excel’s solver!

Student

Number of Ads

New Customers

Newspaper

1-10

900

11-20

600

  

21-30

300

  

Television

1-5

10,000

6-10

5,000

  

11-15

2,000

  

3. Consider the following LP:

max z = 10x1 + x2

s.t. x1 ≤1

20x1+ x2≤ 100

x1,x2≥ 0

a. Find all the basic feasible solutions (bfs) for this LP. (Hint: consider all possible combinations of basic variables)

b. Show that when the simplex algorithm is used to solve this LP, every bfs will be examined before the optimal is found.

4. Use the simplex algorithm to solve the following LP:

max z = 2x1 + x2

s.t. x1+ x2≤ 4

3x1+ x2≤ 6

x1≥ 0,x2 urs

Answers

Maurice Tutor
(5)
Status NEW Posted 27 Jul 2017 11:07 PM My Price 11.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------acq-----------uis-----------iti-----------on -----------of -----------my -----------sol-----------uti-----------on.-----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- ca-----------tch-----------

Not Rated(0)