Formulate this as a Linear Programming Problem, Operation Research

Assignment Help:
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.

Related Discussions:- Formulate this as a Linear Programming Problem

Operations research, state phases of operations research and and their impo...

state phases of operations research and and their importance in solving problems

Scope, Scope of operation research?

Scope of operation research?

Usage in the context of library and information services, Usage in the Cont...

Usage in the Context of Library and Information Services: In library and information science, there is, however, no need for making such distinction between data and informati

Individual user interests - information resources, Individual User Interest...

Individual User Interests: More specific information about users could cover the following:  Subjects and associated interest - e.g. specific subjects, allied subjects;

Explain decision making process, Explain Decision Making Process. Deci...

Explain Decision Making Process. Decision Making Process: A good decision can only be prepared as a result of a rational decision making process. The different stages of the

Methods of calculation of standard deviation , Methods  of calculation of ...

Methods  of calculation of standard deviation a. Calculation of Standard  Deviation  - Individual Series: There  are two methods of calculating standard  deviation in an ind

Linear Programming Problem, A paper mill produces two grades of paper viz.,...

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

LINEAR PROGRAMMING, SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=...

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0

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