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:- Linear Programming Problem

Operation research, 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

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

Narrowing the research problem, NARROWING THE RESEARCH PROBLEM You h...

NARROWING THE RESEARCH PROBLEM You have read how from a general topic we have arrived at the definition of the problem to be studied. Now we have to narrow it down furthe

Weaning and definition, Weaning  and Definition A systematic  arrange...

Weaning  and Definition A systematic  arrangement of classified  data in labelled columns and  rows  is  known  a statistical table. Turtle has given  a comprehensive defin

Attitude measurement and methodology , Case Study  - Attitude Measurement ...

Case Study  - Attitude Measurement National Kitchens For  several years  the management  of national kitchens a diversified packaged foods manufacturer  had been  watch

Assumption of f- test- hypothesis testing, Assumption of F- Test The  ...

Assumption of F- Test The  theoretical assumption on which  F test  is based are: 1.The populations for  each sample must  be normally  distributed  with  identical  mean

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Panel sampling - sampling decisions, Panel Sampling Here the initial  s...

Panel Sampling Here the initial  samples are down  on random  basis  and information  from  these is collected  on regular  basis. Itis  semi permanent sample where members may

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

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

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