lpp, 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:- lpp

Attitude measurement and methodology , Case Study  - Attitude Measurement ...

Case Study  - Attitude Measurement National Kitchens For  several years  the management  of national kitchens a diversified packaged foods manufacturer  had been  watch

Poisson Process, Telephone calls arrive at a switchboard in a Poisson proce...

Telephone calls arrive at a switchboard in a Poisson process at the rate of 2 per minute. A random one-tenth of the calls are long distance. (a) What is the probability of at least

Determine the weekly demand and lead time, Family Application specialises i...

Family Application specialises in selling major appliances for use in kitchen remodelling.  One of its more popular items is the SubZero refrigerator.  Over the past 40 weeks, the

Find the maximum and minimum values, Problems based on solution of a given ...

Problems based on solution of a given LPP when it has multiple optimal solution: 1.    Find the maximum and minimum values of 5x+2y, subject to the constraints -2x-3y ≤ -6

Explain briefly the term sensitivity analysis, Question: (a) A company...

Question: (a) A company sells three different products X, Y and Z. The company makes a profit of Rs. 35, Rs. 50 and Rs. 60 per unit on products X, Y and Z respectively. The th

Inherent limitation concerning mathematical expressions, Operation reac Inv...

Operation reac Involves the use of mathematical models, equations and similar other mathematical expressions. Assumptions are always incorporated in the derivation of an equa

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

Linear programming simplex method, How to solve linear programming problems...

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

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