linear programming problem, Operation Research

Assignment Help:
a paper mill prodecs 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 tib if grade X and Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- linear programming problem

Answer, A paper mill products two grade of paper viz., X & Y. Because of ra...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Objectives of strategic management, Problem What are important objectiv...

Problem What are important objectives of strategic management and the causes for failure t of strategic management Objectives To keep pace with the changing business e

Assignment, Q2. Six Operators are to be assigned to five jobs with the cost...

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 have no assign

Calculation of ranks correlation , Calculation of Ranks Correlation W...

Calculation of Ranks Correlation Where Ranks  are Given: When the  actual  ranks  are given  the steps  followed are: a.Compute  the difference  of the  two ranks  (R1 and

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

Linear programming problem, A paper mill products two grade of paper viz., ...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

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

Simulation , The Neatee Eatee Hamburger Joint specializes in soyabean burge...

The Neatee Eatee Hamburger Joint specializes in soyabean burgers. Customers arrive according to the following inter - arrival times between 11.00 am and 2.00 pm: Interval-arrival

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

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