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

Analyse the average number and mean number, Consider the closed network of ...

Consider the closed network of the following figure. The number at the arrows give the transition probabilities for a customer leaving the queue to route to a subsequent queue. Eve

#title scope.., scope of the operation research in modern management?

scope of the operation research in modern management?

compute probabilities-transitions and transition rate, Consider a queueing...

Consider a queueing system with 1 counter, to which groups of customers arrive according to a Poisson proces with intensity l. The size of a group is 1 with probability p and 2 wit

Explain system control and security tools, 1. Explain the effects that MIS,...

1. Explain the effects that MIS, DSS, CRM and ERP have on organizational communication and decision making to increase productivity and efficiency in an increasingly competitive bu

Application Areas of Linear Programming, what is meant by Application Areas...

what is meant by Application Areas of Linear Programming?

LPP using Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Research and development - information generation process, Research and Dev...

Research and Development: All intellectual activities consciously pursued and systematically completed generate useful information. Research (also Research and Development) is

Linear programming, Solve the following Linear Programming Problem using Si...

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