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. 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 5:57:22 AM | Location :







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
explian completelly the operation reserch

six operators are to be assigned to the 5 jobs with the cost of assignments

Biographies, Handbooks and Dictionaries: Dictionaries: Dictionaries  primarily deal with all aspects of  words from  proper definitions to spellings. Webster's Third Ne

SING TEST The sign test  is the simplest  of the  parametric  tests. Its name comes  from the  fact  that it is based  on the direction ( or sings  for  pluses or minuses ) of

3 In a rectangular game, pay-off matrix of player A is as follows:

Research Abstracts Abstracts of researches completed are available from the followings publications: a. ICSSR Research Abstracts: contain abstracts of research projects

The scientific method in O R study generally involves the followings three phases: 1. Judgment phase, 2. Research phase 3. Action phase

A farmer in the Midwest has 1,000 acres of land on which she intends to plant corn, wheat, and soybeans. Each acre of corn costs $100 for preparation, requires 7 worker-days of la

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

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0