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

Deweys principle - information resources, Dewey's Principle: Melvil De...

Dewey's Principle: Melvil Dewey's principle states: "The best reading for the largest number at the least cost" According to this principle a library should select, within the

Set of pareto optimal policies, Problem: A policy maker is considering seve...

Problem: A policy maker is considering several policy options that lead to different utility levels of different individuals a) Which Policy is would be optimal according t

Linear programing, Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly ...

Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly explain x1,x2,x3;term labour,metal&plastic;the160hours;x1,x2&x3>=0

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

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

Sequencing problem, if one no. is repeated 2-3 times in machine-1 and machi...

if one no. is repeated 2-3 times in machine-1 and machine-2 what is to be prefer first

Rules regarding the table structure, Rules  Regarding the Table  Structur...

Rules  Regarding the Table  Structure a. Table Number: When a number  of tables  are constructed serial number of the tables  should  be given  to each table. b. Title Th

Linear programing, Solve the following Linear Programming Problem using Sim...

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

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

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

Question, Solve the following Linear Programming Problem using Simple metho...

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