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: 408 Weeks Ago, 1 Day 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 > Management Posted 20 Jan 2018 My Price 6.00

linear programming model

A manufacturing firm produces two products. Each product must go through an assembly process and a finishing process. The product is then transferred to the warehouse, which has space for only a limited number of items. The following linear programming model has been developed for determining the quantity of each product to produce in order to maximize profit:

Maximize Z = 30x1 + 70x2 (profit, $) subject to

4x1 + 10x2= 80 (assembly, hours)

14x1 + 8x2=112 (finishing, hours)

x1 + x2=10 (inventory, units)

x1, x2=0

  1. Solve this model graphically.
  2. Assume that the objective function has been changed to Z = 90x1 + 70x2. Determine the slope of each objective function and discuss what effect these slopes have on the optimal solution.
 
 

Answers

(5)
Status NEW Posted 20 Jan 2018 10:01 PM My Price 6.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 -----------pos-----------ted----------- so-----------lut-----------ion-----------.Pl-----------eas-----------e p-----------ing----------- me----------- on-----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be-----------

Not Rated(0)