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 questions for minimum spanning tree problems, Sample Assignment f...

Sample Assignment for minimum spanning tree problems For the subsequent graph get the minimum spanning tree. The numbers on the branches presents the cost.

Characteristics of good average, Characteristics  of Good Average a. ...

Characteristics  of Good Average a. It should  be Rigidly  Defined  An average should  be rigidly defined so that  there is  no confusion  in regard  to its  meaning  and con

RJR NABISCO, WOULD YOU RECOMMEND FOCUS GROUPS OR SOME OTHER RESEARCH DESIGN...

WOULD YOU RECOMMEND FOCUS GROUPS OR SOME OTHER RESEARCH DESIGN IN THIS SITUATION

Cost- sampling decisons, Cost The  cost factor  is a very  importan...

Cost The  cost factor  is a very  important  factor in determining  the size of the  sample. The budget for research should be properly  decided. The management may not lik

Action Phase, What is The proper meaning of action phase will u help me to ...

What is The proper meaning of action phase will u help me to lern it in deeply????

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

Replacement models - operation research model, These models are used whe...

These models are used when one must decide the optimal time to replace equipment for one reason or the other for instance, in the case of equipment whose efficiency dete

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

LINEAR PROGRAMMING, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

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