Linear Programming, Operation Research

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

Related Discussions:- Linear Programming

Reports - classification of documents, Reports: Report literature is a...

Reports: Report literature is an important primary source of information, particularly  for a research library. This new  medium for communication of information came into bei

Operation Research Models, Explain the classification of models 1. Classifi...

Explain the classification of models 1. Classification by function or uses 2. Classification by degree of qualification 3. Classification by physical characteristics 4. Classidicat

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

Explain the history of boots and shoes, Question 1 Explain any five access...

Question 1 Explain any five accessory industries Question 2 Explain the history of boots and shoes Question 3 Write short notes on following- Types of Gujarati emb

Assignment, discuss about assignment and steps involved in it

discuss about assignment and steps involved in it

Scope, With practical example

With practical example

Solve lpp question graphically, A producer of furniture manufactures two pr...

A producer of furniture manufactures two products - tables and chairs. Processing of these products is done on two machines A and B. A chair needs 2 hours on machine A and 6 hours

Lp, #question.Solve the following Linear Programming Problem using Simple m...

#question.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.

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