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

TRANSPORATION PROBLEM, sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2...

sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2 2 3 10 s2 4 1 2 15 s3 1 3 1 40 Demand 20 15 30

Problems, can u send me some assigment problems

can u send me some assigment problems

Linear programming, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Steps of research proposal, Steps of Research Proposal Proposal Con...

Steps of Research Proposal Proposal Content  The researcher is always given instructions for preparing a proposal that indicate the format to be followed. Funding agencie

Linear programing problems, basic requirements for solving linear programin...

basic requirements for solving linear programing using simplex method

Job sequencing problem, on which basis we take value in time out time in co...

on which basis we take value in time out time in column?

Linear programing, A factory employs unskilled workers earning $135 per wee...

A factory employs unskilled workers earning $135 per week and skilled workers earning $270 per week. It is required to keep the weekly age bill below $24,300. The machine requires

TRANSPOTATION, LIMITS OF TRANSPOTATION PROBLEM

LIMITS OF TRANSPOTATION PROBLEM

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

Llp, Solve the following Linear Programming Problem using Simple method. Ma...

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