LLp,Operations research, 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/7/2013 3:58:04 AM | Location : USA







Related Discussions:- LLp,Operations research, Assignment Help, Ask Question on LLp,Operations research, Get Answer, Expert's Help, LLp,Operations research Discussions

Write discussion on LLp,Operations research
Your posts are moderated
Related Questions
Question 1 -Though society as well as culture do not appear to be a part of business situations, yet they are actually key elements in showing how business activities will be cond

Question 1 A) Differentiate among descriptive and inferential analysis of data B) Describe with examples various measures of Central Tendency Question 2 The chi-square

A certain type of machine breaks down at an average rate of 5/hour. the break down is in accordance with Poisson process.cost of idle machine hour is $15/hour. 2 repairmen Peter an

Normal 0 false false false EN-IN X-NONE X-NONE

Video  Tapes  Video  tapes  are very  information  and attention  grabbing  presentational  supports. They  are  best  for illustrating the  persons  in actions  and presen

Data Collection / Requirement Gathering Methods 1. Discuss about the data collection or requirements gathering methods that will be used to conduct the research. 2. Discus

Observation and Data Collection for Better Understanding of the Problem: Many times actual observations by trained observers at the scene of operation may be difficult and da

Techniques  of Work  Measurement A number of work  measurement  techniques  have been  developed  to suit  different  types of work . There are: 1. Repetitive work: The

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

history of modi