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
Marginal Probability Probability of event A happening, denoted by P(A), is called single probability, marginal or unconditional probability. Marginal or Uncondi

In order to compute the inequalities of the form   where n 1 , n 2 , ....... , n k , m 1 , m 2 , ....... , m p are natural and real numbers and a 1 , a 2 , ... , a k ,

Grimm plc (Grimm) has the following transactions: a) On 1 st January 2010, Grimm issued 400,000 convertible £1 6% debentures for £600,000.  The professional fees associated wit

How are Indian customers visiting Shoppers’ Stop any different from customers of developed western countries?

(x+1/x)^2=3 then value of x^72+x^66+x^54+x^36+x^24+x^6+1 is

Write down two more reasons why children consider 'division' difficult. Regarding the first reason given above, one of fie few division related experiences that the child perhaps d

The distance around a square photograph is 12.8 centimeters. What is the langth of each side of the fotograph?

Find out a series solution for the following differential equation about x 0 = 0 y′′ + y = 0.   Solution Note that in this case p(x)=1 and therefore every point is an or

Rectilinear Distance (Total Travel Distance per Day Using Rectilinear Distance): It can be computed through using following formula: d(X, Pi) = |x - ai| + |y - bi| (Source: T