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

Linear programming, B A paper mill produces two grades of paper viz., X and...

B 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

Optimal assingment, words each) Q2. Six Operators are to be assigned to fiv...

words each) Q2. Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will ha

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

Analyzing marketing problems and cases , Cases are generally based on certa...

Cases are generally based on certain issues and problems. Diagnostic, analytical and decision making skills help in case solution. A case study or case based assessment is designed

Mip, procedure of mip

procedure of mip

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

LPP, a paper mill produce two grades of paper viz., X and Y. because of raw...

a paper mill produce two grades of paper viz., X and Y. because of raw material restrictions, it cannot produce more than 400 tona of grade X and 300 tons of grade Yin a week. ther

LPP, 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