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

Solve the problem using simplex method, #question. A paper mill produces tw...

#question. 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 grad

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

Inflation, Inflation Inflation is a general...

Inflation Inflation is a general increase in the price of goods and services. The inflation rate, as measured by the

Model, Importance of models

Importance of models

data analysis and research methodology , Case  Study - Data Analysis ...

Case  Study - Data Analysis Sandarsen  inc was testing new  packaging  and a few  recipe  for a family  desert cookie  that had  been  on the  market for several years. It wa

Inventory Control Model, 1. A local university purchases exercise books to ...

1. A local university purchases exercise books to give to their students. Instead of a fixed unit cost, their supplier quotes the following discount pricing: Order quantity Unit P

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

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

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

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

Table of contents - report writing presentation, Table of contents ...

Table of contents The tables  of contents  is an outline  of the order  of the chapters sections and  sub  section  with their  respective  pages. If  report  includes  a n

First paper, discuss the seauencing decision problem for n jobs on two and ...

discuss the seauencing decision problem for n jobs on two and three machines

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