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

#, Six Operators are to be assigned to five jobs with the cost of assignmen...

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

Testing operation research model, After testing the model and its solutio...

After testing the model and its solution the next step of the study is to establish control over the solution by proper feedback of the information on variables which deviated

Steps of research process, Steps of Research Process The steps of resear...

Steps of Research Process The steps of research process have already been discussed in theory. Here we shall outline the procedure of conducting the research. i) Formulate t

Research design and methodology , Case Study - Research Design RJR N...

Case Study - Research Design RJR Nabisco Ever since the health aspects of smoking became a public issue shortly after world war II the tobacco industry knew there

Simlex method, explaination

explaination

the simplex method, In large sized linear programming problems, the ...

In large sized linear programming problems, the solution cannot be obtained by the graphical method and hence a more systematic method has to be developed to find

Government documents - classification of documents, Government Documents: ...

Government Documents: Government publications are the official documents brought out at government expense. They are the records of activities of the (1) Executive, (2) Legis

Simplex method, Solve the following Linear Programming Problem using Simple...

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

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

BIG M, Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages