linear programming, Operation Research

Assignment Help:
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 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 ton of grade X and Y paper respectively. Formulate this as a Linear Programming Problem

Related Discussions:- linear programming

Answering question to find shortest path, Answering Question to Finding Sho...

Answering Question to Finding Shortest Path - Operation Research Assignment Help Finding answers for shortest path problems are quite interesting and not easy to solve. In solv

Operation research techniques, High Costs are Involved in the Use of O. R...

High Costs are Involved in the Use of O. R Techniques: O. R techniques usually prove very expensive. Services of specialized persons are invariably called for ( and along w

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

Explain the graicunas theory, Question 1 Discuss the impact of Henry Fayol...

Question 1 Discuss the impact of Henry Fayol's principles of management on the modern techniques of management with the help of suitable examples Question 2 Explain the Gary

Assignment SMU, A paper mill produces two grades of paper viz., X & Y. Bec...

A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week.

Methodology, what are the methodology of operation research

what are the methodology of operation research

Linear programing, main components of a linear programming

main components of a linear programming

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

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

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