linear programming problem, 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:- linear programming problem

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

Determination of effectiveness measures, Determination of effectiveness Mea...

Determination of effectiveness Measures: Effectiveness measure is a measure of success of a model in representing a problem and providing a solution. It is the connecting link

Higher order table, Higher Order Table When three or more charac...

Higher Order Table When three or more characteristics are represented in the same table such a table is called higher order table. The need for such a table arises

Scientific research, Scientific research is building of knowledge throug...

Scientific research is building of knowledge through collection of empirically verifiable facts. The term verifiable here means which can be checked by others for accuracy

Multiple objectives- sampling decisions, Multiple Objective s The sam...

Multiple Objective s The sample may vary according to the objective of the research. There may several objectives of marketing research so the sample size may vary a

Decision theory, the following table gives place under different states of ...

the following table gives place under different states of nature Strategies States of nature s1 s2 s3 A 10000 3000 2000 B

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

#Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Li, line drawn as Y=C+1075x, when x was 2, and y was 239, given that y inte...

line drawn as Y=C+1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residualon..

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

Preparation of script - report writing presentation , Preparation of Script...

Preparation of Script The most tedious and arduous takes is the preparation of the script. While you have all the ideas and points will should stored up in the mi

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages