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

Maths, Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Linear programming, Q3. Solve the following Linear Programming Problem usi...

Q3. 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

information on research done, Information on Research Done Informatio...

Information on Research Done Information on Doctoral research work already done  is available from  the followings  sources: a. Bibliography of Doctoral  Dissertations Acce

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

Operation Research.., 3. Explain ‘Vogel Approximation Model (VAM)’.? answer...

3. Explain ‘Vogel Approximation Model (VAM)’.? answer please

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

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

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 assignment

Linear programming problem, Solve the following Linear Programming Problem ...

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