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

#title.definition of graphical method ., full detailor theory on graphical ...

full detailor theory on graphical method

Answer, A paper mill products two grade of paper viz., X & Y. Because of ra...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Oral presentation - report writing presentation, Oral Presentation At ...

Oral Presentation At times oral presentation of the results of the study is considered effective particularly in case where policy recommendations are indicated by project

CORE TECHNOLOGY TO WATCH IN FUTURE, AI TECHNOLOGY''S CURRENT AND POTENTIAL ...

AI TECHNOLOGY''S CURRENT AND POTENTIAL FUTURE APPLICATIONS

Variables, Variables A concept which varies is variable. These can be ...

Variables A concept which varies is variable. These can be different in quantitative values. For example, weight, height, income are examples of variables. Qualitative phenom

Data collection procedure, A series of questionnaire for Delphi were mailed...

A series of questionnaire for Delphi were mailed to the selected experts who meet the criteria that mention in above. The overall purpose of the Delphi technique was to achieve the

PERT/CPM and Game theory, #questionC++ Program for PERT/CPM and Game theory...

#questionC++ Program for PERT/CPM and Game theory..

#title big m method, ..c++ program in Bid M method

..c++ program in Bid M method

Solve the following Linear Programming Problem using Simple , Solve the fol...

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

TRANSPORATION PROBLEM, sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2...

sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2 2 3 10 s2 4 1 2 15 s3 1 3 1 40 Demand 20 15 30

Write Your Message!

Name

Email id

Message

Verfication Code

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!

Submit Assignment

User Account

All Pages