linear programming problem, Operation Research

Assignment Help:
a paper mill prodecs 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 in a week. there are 160 production hours in a week. It requires 0.20 and 0.40 hours to produce a ton of grade X and Y papers. The mill earns a profit of Rs. 200 and Rs. 500 per tib if grade X and Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- linear programming problem

Concept of reporting entity, Briefly discuss the concept of Reporting Entit...

Briefly discuss the concept of Reporting Entity in SAC 1 How asset is defined and recognised under the AASB Framework? Silver Developers Ltd is a property development company

Decision trees, Ask questioA farmer intends to drill a well for his herd. I...

Ask questioA farmer intends to drill a well for his herd. In the past, only 80% of the wells drilled in this area were successful at 12 metres of depth. On finding no water at 12 m

Dual of the lpp, the dual form of the following lpp min z=3x1+2.5x2 constra...

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0

Chart the historical prices based on the monthly data, Choose a publicly tr...

Choose a publicly traded company (NYSE, AMX, or OTC) that interests you. If you don't know how to choose a company, think of IBM, DELL computer, Nike, Apple computer, GM, Ford, Nok

Draw a network for the project adn determine the critical pa, a)Draw a netw...

a)Draw a network for the project. b)Determine the critical path. Activity Duration Activity Duration 1-2 15 5-10 22 1-3 13 6-9 33 1-4 1

Need answer, A paper mill produces two grades of paper viz., X and Y. Becau...

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

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

Model building, model building is the essence of the operational research d...

model building is the essence of the operational research discuss

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