linear programming problem, Operation Research

Assignment Help:

A paper mill produces two grades of paper viz., X and Y. Because of raw
each)
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 problem

Comparing tablet personal computers with personal computer, Background: ...

Background: The use of "Tablet Personal Computers" such as HP's TouchPad and Apple's iPad has been increasing over the past several years. Task: Using a web browser and quality,

Graphical solution procedure, Graphical Solution Procedure sample assignmen...

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

Stepping stone method, This is a procedure of determining the potential i...

This is a procedure of determining the potential if any for improving each of the non basic variables in terms of the objective function. To determine this potential each of

Identifying the solution to a problem, Software House named as Harvester, g...

Software House named as Harvester, got to increase the speed of service and I need to get 3000 words written

#title big m method, ..c++ program in Bid M method

..c++ program in Bid M method

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

Higher order table, Higher Order Table When three or more charac...

Higher Order Table When three or more characteristics are represented in the same table such a table is called higher order table. The need for such a table arises

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

Least cost methods, The NW corner rule described earlier considers only...

The NW corner rule described earlier considers only the availability and supply requirements in making assignments. It takes no account of the shipping costs given in

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 & x 1 ≥ 0, x 2 ≥ 0 [Ans. Max Z = 235/19

Write Your Message!

Name

Email id

Message

Verfication Code

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!

Submit Assignment

User Account

All Pages