Linear Programming Problem, 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 Problem

Service distribution of the machines in a bank, ABC Bank faces a decision t...

ABC Bank faces a decision to hire two clerks or lease two automatic teller machines. Service rates of clerk 1 and clerk 2 are 41 customers per hour and 36 customers per hour respec

Inventory control research, Given an inventory system where Yearly demand ...

Given an inventory system where Yearly demand = 120 units Ordering cost = Sh. 45 Price per unit = Sh. 200 Annual carrying cost = 24% of the unit cost Determine The economic or

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

Probability distribution , Normal 0 false false false E...

Normal 0 false false false EN-IN X-NONE X-NONE PROBABILITY DISTRIBUTION

Plz get the ans , #questioA paper mill produces two grades of paper viz., X...

#questioA 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

Management Applications of Operation Research, Some areas of applications a...

Some areas of applications are Purchasing, Procurement and Exploration Quantities and timing of purchase Replacement policies Rules for buying, supplies Finance, Budgeting and Inv

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

Graphic , max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x...

max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x1+2x2 X1+x2. >_ o

Variables, Variables A concept which varies is variable. These can be ...

Variables A concept which varies is variable. These can be different in quantitative values. For example, weight, height, income are examples of variables. Qualitative phenom

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