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

Inherent limitation concerning mathematical expressions, Operation reac Inv...

Operation reac Involves the use of mathematical models, equations and similar other mathematical expressions. Assumptions are always incorporated in the derivation of an equa

Scope, Scope of operations research

Scope of operations research

Steps of field study, Festinger and Katz have described followings six ste...

Festinger and Katz have described followings six steps in the conduct to a field study. a. Preliminary Planning :Deciding scope and objectives of study and the time table

LINEAR PROGRAMMING, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Simplex method LPP, #questioA paper mill produces two grades of paper viz.,...

#questioA 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

LPP, USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJE...

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

Automation, whatdo you mean by automation

whatdo you mean by automation

Models, what is similation model as a type of mathematical models

what is similation model as a type of mathematical models

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