Binding constraints for the original linear program model, Mathematics

A toy company produces 2 models of water guns: spray king and zapper. They are manufactured in batches for easier packaging and sale. Two of the limiting resources are 1200 pounds of special plastic material available a week to make two models, and 40 hours of production time that are available each week.

The spray king model requires 2 pounds of plastic per batch, while zapper needs 1 pound of plastic per batch. Production time in minutes per batch for spray king is 3 minutes. Each batch of zapper requires 4 min of production time.

The profit from each batch of spray king is $8. For zapper, the profit is $5 per batch. The company's objective is maximize weekly profit.

A manufacturing restriction is that the weekly production of spray king cannot exceed the weekly production zapper by more than 450 batches. This is referred to as the "mix" constraint. Also, the total weekly production for the two models combined cannot exceed 800 batches each week. This is referred to as the "total production" constraint.

Use the following variable:

X1= Number of batches of spray king manufactured each week

X2=Number of batches zapper manufactured each week      

1. ) determine the Linear Programming model that represents the describes scenario.

2.) To maximize profit, what is the number of batches that should be produced weekly?

3.)Calculate the maximum weekly profit

4.) If the profit per batch of zapper falls to $4, in order to have (i) multiple optimal solutions, and (ii) the profit per batch of zapper be less than that of spray king, the profit per batch of bag of spray king should be

A.) $2.00                                                         B.) $10.00

C.) $8.00                                                         D.) $5.00

5.) What is the binding constraints for the original linear program model?

Posted Date: 2/26/2013 12:17:23 AM | Location : United States

Related Discussions:- Binding constraints for the original linear program model, Assignment Help, Ask Question on Binding constraints for the original linear program model, Get Answer, Expert's Help, Binding constraints for the original linear program model Discussions

Write discussion on Binding constraints for the original linear program model
Your posts are moderated
Related Questions
Value of perfect information This relates to the amount that we would pay for an item of information such would enable us to forecast the exact conditions of the market and act

Q. How many permutations can you make of the word STATISTICS? Solution:  There are 10 letters in the word STATISTICS, i.e. n=10. Three of them are S's, so n 1 =3, three are T'

Differentiate following. Solution : It requires the product rule & each derivative in the product rule will need a chain rule application as well. T ′ ( x ) =1/1+(2x) 2

Solve 6 sin ( x/2)= 1 on [-20,30] Solution Let's first work out calculator of the way since that isn't where the difference comes into play. sin( x/2)= 1/6   ⇒x/2= sin

Evaluate following limits. Solution Let's begin with the right-hand limit.  For this limit we have, x > 4  ⇒          4 - x 3   = 0      also, 4 - x → 0  as x → 4

It is the last case that we require to take a look at. During this section we are going to look at solutions to the system, x?' = A x? Here the eigenvalues are repeated eigen

given dimensions: 130cm, 180cm, and 190cm is to be divided by a line bisecting the longest side shown from its opposite vertex. what''s the area adjacent to 180cm? ;

how do you find the average of a number

2qt :6qt::x :48? help me solve x