Linear Programming , Operation Research

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. 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. Formulae this as a Linear programming problem
Posted Date: 2/19/2013 1:26:49 PM | Location : USA







Related Discussions:- Linear Programming , Assignment Help, Ask Question on Linear Programming , Get Answer, Expert's Help, Linear Programming Discussions

Write discussion on Linear Programming
Your posts are moderated
Related Questions
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

a. Determine the following with respect to decision making approaches: (i) Group decision making (ii) Directive, analytic, conceptual and behavioral decision making styles (8

Assignments should be submitted via FLO by the above deadline. Penalties for late submission are as set out in the topic SAM on FLO. Extensions can be granted in line with standard

REPORT WRITING The final step in research is to report the study  findings to those  who authorized the investigation. The American marketing association is  of the opinion  t

. 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

the application areas of linear programming

The plant is using the chase production option and the ATO process design. The BOM is illustrated below.   Requirement The factory works on a process layout but

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

Panel Sampling Here the initial  samples are down  on random  basis  and information  from  these is collected  on regular  basis. Itis  semi permanent sample where members may

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