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

LPP., A constraints in an LPP restricts? (Value of objective function,Value...

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

What is critical defect, Question 1 What is intrinsic quality? Explain key...

Question 1 What is intrinsic quality? Explain key dimensions of a quality product or service Question 2 Explain any five sources of standards Question 3 What is Critical

Decision making - operation research, Decision making is not only the h...

Decision making is not only the headache of management rather all of us make decisions. We daily decide about minor issues. The essential characteristics of all decisions

Linear programming examples, Solved LP Sample Assignment & Questions A ...

Solved LP Sample Assignment & Questions A person desires to decide the ingredients of a diet which will satisfy his routine necessities of fats, proteins, and carbohydrates at

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow...

Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

Research essay, how Network Scheduling solving a real problem in a real bus...

how Network Scheduling solving a real problem in a real business .

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

Operation research and decision making, Operations Research uses the meth...

Operations Research uses the methods of science to understand and explain the phenomena of operating systems. It devises the theories( models ) to explain these phenomena

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