Linear programming , Operation Research

Assignment Help:
#quesQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones 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.25and 0.40 hours to produce a ton of grade z snf y psprtd. 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. tion..

Related Discussions:- Linear programming

Convenience sampling - sampling decisions , Convenience  Sampling In...

Convenience  Sampling In  convenience  sampling  selection the researcher chooses the  sampling  units on the   basis of convince or  accessibility. It is  called  accidental

OR, Models in OR

Models in OR

Assignment, Q2. Six Operators are to be assigned to five jobs with the cost...

Q2. 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 assign

Model, disadvantages of model in operational research

disadvantages of model in operational research

Scattered responsibility and authority, Scattered Responsibility and Autho...

Scattered Responsibility and Authority: In a big industry responsibility and authority of decisions making is scattered throughout the organization and thus the organization.

Advantages of mode - measure of central tendency, Advantages of Mode ...

Advantages of Mode a.It is easy to understand  as well as easy  to calculate. In  can be found out by  inspection. b.It is  usually an exacta value  as it  occurs most fre

What do you understand by the term queueing theory, Question: (a) (i) W...

Question: (a) (i) What do you understand by the term ‘queueing theory'? Give two real life examples to illustrate your answer. (ii) Outline the five components involved in

Answering question to find shortest path, Answering Question to Finding Sho...

Answering Question to Finding Shortest Path - Operation Research Assignment Help Finding answers for shortest path problems are quite interesting and not easy to solve. In solv

Linear programimg, 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

Linear pograming, application area of linear programing problem

application area of linear programing problem

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