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

Biographies, Biographies, Handbooks and Dictionaries: Dictionaries: ...

Biographies, Handbooks and Dictionaries: Dictionaries: Dictionaries  primarily deal with all aspects of  words from  proper definitions to spellings. Webster's Third Ne

Reasearch on software design, Write a research paper in relation to a Softw...

Write a research paper in relation to a Software Design related topic. Diagrams and drawing of attention to key points through highlighting, bulleting etc is encouraged. Questi

MINIMIZATION., Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=2...

Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=28 2??1+12??2=24 ??1,??2=0 a. A basic solution of the constraint equations of this problem has how many basic variables,

Linear Programming Problem using Simple method, Solve the following Linear ...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Least cost method of transportation model, how do you calculate using this ...

how do you calculate using this method where the least cost appears twice

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Optimization, Find a minimum cost spanning arborescence rooted,

Find a minimum cost spanning arborescence rooted,

Scope of operations research, Scope of the OR techniques can be derived ...

Scope of the OR techniques can be derived in followings various importance fields: 1. In Agriculture : With the explosion of population and consequent shortage of food O

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