linear programming 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:- linear programming problem

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

Scope, With practical example

With practical example

Assignment, Q2. Six Operators are to be assigned to five jobs with the cost...

Q2. Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assign

Experimental method, In this method variables beings studied are contro...

In this method variables beings studied are controlled by the investigator. In other the effect of one variable is observed while other relevant variables are held constant

Big M method, Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Methodology, what are the methodology of operation research

what are the methodology of operation research

OPERATION RESEARCH, A paper mill produces two grades of paper viz., X and Y...

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

Coding and retrieval , Coding  and Retrieval  If all your  data ar...

Coding  and Retrieval  If all your  data are  word processed on in some  other  computer readable form  it will  be possible  for your  primary  documents  to be accessed d

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

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