Binding constraints for the original linear program model, Mathematics

Assignment Help:

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?


Related Discussions:- Binding constraints for the original linear program model

How to calculate mode, Q. How to calculate Mode? The mode of a data set...

Q. How to calculate Mode? The mode of a data set is the value that is repeated most often in the data set. It has the highest frequency. There can be one, more than one, or n

What was joe's approximate raw act score, Using the same mean and standard ...

Using the same mean and standard deviation from problem 10 (mean m = 20.1 and a standard deviation s = 5.8). Joe was informed that he scored at the 68 th percentile on the ACT, wh

Differential equation, Suppose a fluid (say, water) occupies a domain D? R^...

Suppose a fluid (say, water) occupies a domain D? R^(3 ) and has velocity field V=V(x, t). A substance (say, a day) is suspended into the fluid and will be transported by the fluid

Decision trees and sub sequential decisions, Decision Trees And Sub Sequent...

Decision Trees And Sub Sequential Decisions A decision tree is a graphic diagram of different decision alternatives and the sequence of events like if they were branches of a t

Proof for absolute convergence - sequences and series, Proof for Absolute C...

Proof for Absolute Convergence Very first notice that |a n | is either a n or it is - a n depending upon its sign.  The meaning of this is that we can then say, 0 a n +

Shortricks, shortricks of compound interest

shortricks of compound interest

Word problem, a recipe good for 4 servings require 1/8 tsp. black pepper an...

a recipe good for 4 servings require 1/8 tsp. black pepper and 1/2 tsp. of salt. how much black pepper and how much salt needed for 2 servings?

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd