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

Lcd projectors - reoprt writing presentation , LCD Projectors  LCD...

LCD Projectors  LCD projectors  are several  steps  ahead of conventional OHPs. These  projectors  are more  compact  and more  powerful  and can  be directly  linked to a

Duality, For every LP formulation there exists another unique linear ...

For every LP formulation there exists another unique linear programming formulation called the 'Dual' (the original formulation is called the 'Primal'). Same data

Inventory models - techniques of operations research, Inventory models deal...

Inventory models deal with the problem of determination of how much to order at a point in time and when to place an order. The main objective is to minimize the sum of three

Equation, A paper mill produces two grades of paper viz., X and Y. Because ...

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 i

Linear programing, Solve the following Linear Programming Problem using Sim...

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

Calculate the yearly cost of waiting time, The Omega company, Brisbane, pro...

The Omega company, Brisbane, produces potato chips, corn, cheese twists, and popcorn. These products are made in Brisbane and then shipped to company warehouses and distribution ce

Case Analysis, Ask question #Minimum 100 woRead this article and then write...

Ask question #Minimum 100 woRead this article and then write a three-page summary of the application (problem definition, objective function constraints, decision variables, etc.)

Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 =...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X 1, 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