op, 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:- op

Linear proramming , A paper mill produces two grades of paper viz., X and Y...

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

LPP, USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJE...

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

C++ programs, C++ code for assignment problem

C++ code for assignment problem

Higher order table, Higher Order  Table   When  three  or more  charac...

Higher Order  Table   When  three  or more  characteristics are represented in the same  table such a table  is called  higher order table. The  need  for such  a table arises

Unit 8, undertake the proposed research investigation in accordance with th...

undertake the proposed research investigation in accordance with the agreed specification and procedures

Methodology of operation research, The systematic methodology developed f...

The systematic methodology developed for an operation research study with problems involving conflicting multiple objective policies and alternatives. Operation research in

Steps involved in linear programming problem formulation, Question A - Line...

Question A - Linear Programming is most widely used technique for large number of applications in business industry as well as in various other fields. Describe in brief the steps

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Use of t -tables - hypothesis testing , Use of t -tables            ...

Use of t -tables            Similar  to normal  curve  tables  there  exist t- distribution  tables. However  whereas the properties of  the normal  curve are constant for all

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