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

Linear programming , A paper mill prouduces two grads of paper viz., X and ...

A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 400 tons of grade X paper and 300 tons of grade Y paper in

Non-governmental organisation, Name the feature which is not normally assoc...

Name the feature which is not normally associated with a Non-Governmental Organisation (NGO)?  Government funded is the organisation.

Find out where you should now invest your money, Question : Suppose tha...

Question : Suppose that you want to invest $10000 in the stock market by buying shares in one of two companies: A and B. Shares in Company A are risky but could yield a 50% ret

RJR NABISCO, WOULD YOU RECOMMEND FOCUS GROUPS OR SOME OTHER RESEARCH DESIGN...

WOULD YOU RECOMMEND FOCUS GROUPS OR SOME OTHER RESEARCH DESIGN IN THIS SITUATION

Queuing theory, A certain type of machine breaks down at an average rate of...

A certain type of machine breaks down at an average rate of 5/hour. the break down is in accordance with Poisson process.cost of idle machine hour is $15/hour. 2 repairmen Peter an

LINEAR PROGRAMMING, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Sample linear programming problems to calculate max profit, The following l...

The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch

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

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