Problem, 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:- Problem

Dynamic programming models, Dynamic programming may be considered thoutgr...

Dynamic programming may be considered thoutgrowth of mathematical programming and involves the optimization of multistage( sequence of inter related decisions) decision process

Linear programming problem, Solve the following Linear Programming Problem ...

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

Census method, Census Methods Complete Enumeration: If detail informat...

Census Methods Complete Enumeration: If detail information  regarding every individual  person  or item of a given   universe ( or  population ) is  collected then the  enquir

Deweys principle - information resources, Dewey's Principle: Melvil De...

Dewey's Principle: Melvil Dewey's principle states: "The best reading for the largest number at the least cost" According to this principle a library should select, within the

Assumption of f- test- hypothesis testing, Assumption of F- Test The  ...

Assumption of F- Test The  theoretical assumption on which  F test  is based are: 1.The populations for  each sample must  be normally  distributed  with  identical  mean

Simple graph-correlation and regression analysis, Simple Graph The val...

Simple Graph The values of the two variables are plotted on a graph paper. We get two curves one for x variables and another for y  variables. These  two curves reveal the dir

Simplex method, Solve the following Linear Programming Problem using Simple...

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

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Simplex method, how to solve simplex method in LPP?

how to solve simplex method in LPP?

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