linear programming, 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:- linear programming

One sample runs test - hypothesis testing, ONE SAMPLE  RUNS  TEST A ...

ONE SAMPLE  RUNS  TEST A number of  methods have been  developed fro  judging the randomness of samples on the basis of  the order in which  teh observations  are taken. It is

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

Graphic methods - correlation regression analysis, Graphic Methods a. ...

Graphic Methods a. Scatter Diagram: Scatter  diagram  is a special  type of dot chart.  Under  this methods  the given data are  plotted in  a graph  paper  in the form of  d

Lpp, . A paper mill produces two grades of paper viz., X and Y. Because of...

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

Scope, Scope of operation research?

Scope of operation research?

Area under standard normal curve, Area under Standard Normal Curve The...

Area under Standard Normal Curve The graph  of the  standard  normal  curve y = p(z) with  different percentages areas is  shown here. Since p(z) is  a probability  distributi

Seven step to a successful presentation, Seven Step to a Successful Present...

Seven Step to a Successful Presentation There  are seven  basic  step which  need to  kept  in mind at the  time of  making  a presentation. How  successful one  is at eh end

Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 =...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X 1, X2 = 0

Research essay, how Network Scheduling solving a real problem in a real bus...

how Network Scheduling solving a real problem in a real business .

SIMPLEX METHOD, Solve the following Linear Programming Problem using simple...

Solve the following Linear Programming Problem using simple method Maximize Z= 3x1 + 2x2 Subject to the constraints: X1 + X2 = 4

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