question, Operation Research

Assignment Help:
A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week. There are 160 production hours in a week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns a profit of Rs.200 & Rs.500 per ton of grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- question

Shubham, what is the job scope in or?

what is the job scope in or?

Applications of statistics in management, In a business, statis...

In a business, statistics is used to study the demand and market characteristics of the product or service being sold. In fact, market research

Linear programming, Solve the following Linear Programming Problem using Si...

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

Level of significance - hypothesis testing , Level of Significance I...

Level of Significance In testing a given  hypothesis  the maximum  probability with which  we would  be willing  to take  risk is called  level of  significance of the  test.

Uses of mode - measure of central tendency, Uses of Mode The  use of t...

Uses of Mode The  use of the mode is recommended in the following  situations: a.When a quick  and approximate measures of  central tendency desired. b.When the  measure

Computer aid for quantitative data analysis, Normal 0 false ...

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

Solve lpp question graphically, A producer of furniture manufactures two pr...

A producer of furniture manufactures two products - tables and chairs. Processing of these products is done on two machines A and B. A chair needs 2 hours on machine A and 6 hours

Optimal assigment, #quesSix Operators are to be assigned to five jobs with ...

#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

MINIMIZATION., Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=2...

Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=28 2??1+12??2=24 ??1,??2=0 a. A basic solution of the constraint equations of this problem has how many basic variables,

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd