linear programming, Operation Research

Assignment Help:
Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where as the coffee bar cost 0.40 to make and sells for 0.55. The company has 15.000 ounces of chocolate in stock, and the manager identify that each ounce of banana bar requires 10 ounces of chocolate while the coffee bar requires 35 ounces of chocolate. In addition, the manager has specified that a minimum of 1000 of the banana bars and 1200 of the coffee bars should be made.

1. what are the decisions variables in this problem

2. what are the constraints

3. formulate a linear programming model that will enable the manager to determine how many of each kind of bar to produce in order to satisfy the conditions specified with maximum profitsed#

Related Discussions:- linear programming

North west corner rule, North West Corner Rule for Initial Solution: Now ...

North West Corner Rule for Initial Solution: Now by applying North West corner rule we can initial solution. According to this rule without regard to cost consideration the

International trade, why does south africa regulate int''l trade

why does south africa regulate int''l trade

Model, disadvantages of model in operational research

disadvantages of model in operational research

Describe the service tax law in usa and concept of negative, Question 1 ...

Question 1 X Ltd. has Unit C which is not functioning satisfactorily. The following are the details of its fixed assets: Asset Date of acquisiti

Limitation - report writing presentation, Limitation  The  report s...

Limitation  The  report should  also point  out the  main  limitation of the  research reported  therein. This  will be helpful  to the reader who can form  his own opinion

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

Solve by computational procedure of big – m method, Example 2 Max Z = 3...

Example 2 Max Z = 3x 1 - x 2 Subject to             2x 1 + x 2 ≥ 2             x 1 + 3x 2 ≤ 3             x 2 ≤ 4     &     x 1 ≥ 0, x 2  ≥ 0   A

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