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

Information resources - selection principles, INFORMATION RESOURCES - SELEC...

INFORMATION RESOURCES - SELECTION PRINCIPLES: Selection of materials for a library requires sagacity, adroitness and attention to people's needs for everything from books and

Optimal assignment, Six Operators are to be assigned to five jobs with the ...

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

Vogel''s approximation method, I''m getting a negative value in the one of ...

I''m getting a negative value in the one of the Supply/Stock columns while solving a problem in Vogel''s approximation method. Is it possible or am I doing anything wrong?

Examine the future sustainability of business, In your role as a Consultant...

In your role as a Consultant to a renowned organisation or institution, you have been asked to design and submit a research proposal to examine the future sustainability of its bus

Methods of survey and study, Methods of Survey and Study: Some method...

Methods of Survey and Study: Some methods of collecting information about the organisation and about the information requirement of potential users are mentioned below. No si

Need of research proposal, Need Proposals are written for various reas...

Need Proposals are written for various reasons. They are prepared for different reasons which vary to the extent of details expected, but like research reports, the proposal a

Sample size in non propbability- sampling decisions, Sample Size in Non Pro...

Sample Size in Non Propbability The probability selection does not apply to purposive selection. The size of the non probability samples is selected in a subjective ma

Mb0048, 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

Linear programming simplex method, How to solve linear programming problems...

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1. Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X, y ≥ 0

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages