Formulate this as a 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:- Formulate this as a Linear Programming Problem

Considerations for oral reporting, Considerations for Oral Reporting S...

Considerations for Oral Reporting Sometimes the researcher has been asked to make an oral presentation of his research findings he should bear in mind a few major conside

Mccolvin''s principles, McColvin's Principles: L.R McColvin advanced h...

McColvin's Principles: L.R McColvin advanced his Demand and Supply Theory of Book Selection in 1925. He states, "Books in themselves are nothing. They have no more meaning tha

#transportation and linear models.., #what is the similarity and difference...

#what is the similarity and differences between transportation and linear programing models?

Question, A paper mill produces two grades of paper viz., X & Y. Because of...

A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week.

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

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

Degrees of freedom, Determining Degrees of Freedom One of the prer...

Determining Degrees of Freedom One of the prerequisites for using chi square test is that we should calculate the number of degrees of freedom for the contingency table. T

Linear programming problem, Solve the following Linear Programming Problem ...

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

Optimization , A company uses 4 pounds of resource 1 to make each unit of X...

A company uses 4 pounds of resource 1 to make each unit of X1 and 3 pounds of resource 1 to make each unit of X2. There are only 150 pounds of resource 1 available. Which of the fo

Graphic methods - correlation regression analysis, Graphic Methods a. ...

Graphic Methods a. Scatter Diagram: Scatter diagram is a special type of dot chart. Under this methods the given data are plotted in a graph paper in the form of d

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!

Name

Email id

Message

Verfication Code

User Account

All Pages