Answer, Operation Research

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.
Posted Date: 2/20/2013 6:46:11 AM | Location : USA







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

Write discussion on Answer
Your posts are moderated
Related Questions
Festinger and Katz have described followings six steps in the conduct to a field study. a. Preliminary Planning :Deciding scope and objectives of study and the time table

Decide upon  the Objective  What is it that you  aim to  achieve  the end  of the  presentation ? your  objective  should  be crystal  clear. Do  not stray or move  a ways

#quesSix Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assig

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 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


These models are used to develop a method to evaluate the merit of alternative courses or action by representing with a mathematical model of the problems where various variab

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

Uses   of Standard Deviation Normal 0 false false false EN-IN X-NONE X-NONE

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment