Formulate this as a Linear Programming Problem., 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. 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
Posted Date: 2/13/2013 7:56:01 AM | Location : USA







Related Discussions:- Formulate this as a Linear Programming Problem., Assignment Help, Ask Question on Formulate this as a Linear Programming Problem., Get Answer, Expert's Help, Formulate this as a Linear Programming Problem. Discussions

Write discussion on Formulate this as a Linear Programming Problem.
Your posts are moderated
Related Questions
ABC Company manufactures both interior and exterior paints from 2 raw materials M1 and M2. The following table gives basic data of problem.     Exterior

Edwards Life Sciences is trying to decide if it should sell a new type of medical product. Fixed costs associated to the production of the product are estimated to be $30,000. Th

EXPLAIN THE CONCEPT OF DUALITY IN LPP THROUGH A LIFE SITUATION

operation research scope

#questionC++ Program for PERT/CPM and Game theory..

Chi square Test for the Population variance When we want  to test that  a random  sample  has been  drawn  from  a normal  population having specified variance then X2 statist

Formulation of the Problem: Before proceeding to find the solution of a problem, first of all a manager should be competent enough to form an appropriate model. To do so f

Project Management Your  data need to be organized in such  a way that  access to them  is both  quick  and accurate. In  achieving  this a good qualitative analysis progra

Customers arrive to a super market according to a Poisson process with intensity V = ½  per minute. The supermarket has two counters, that use a common queue. Counter 1 is always o

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0