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
what are the dimensions of the box that can be made if squares of x cm by x cm is cut off from 20cm by 20cm square paper

there are 5 small cubes and it reads the 5 small cubes is 1/100, then what is the ONE?

Mathematical Problem Solving In 1945, mathematician George Polya (1887-1985) published a book titled How To Solve It in which he demonstrated his approach to solving problems.

Applications of derivatives : At last, let's not forget about our applications of derivatives. Example    Assume that the amount of air in a balloon at any time t is specified

Expected Value of Perfect Information In the above problems we have used the expected value criterion to evaluate the decisions under the conditions of risk. But, as long as un


Jennifer ?ipped a coin three times and got heads each time. What is the probability in which she gets heads on the further ?ip? The probability of heads does not modify based o

i want to work with you, please guide me

What is the square root of 36? To search the square root (√) you ask yourself, "What number multiplied through itself gives me 36?" 6 .6 = 36; thus, 6 is the square root of 36.

Problem 1. Find the maximum and the minimum distance from the origin to the ellipse x 2 + xy + y 2 = 3. Hints: (i) Use x 2 + y 2 as your objective function; (ii) You c