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

Queuing theory, A certain type of machine breaks down at an average rate of...

A certain type of machine breaks down at an average rate of 5/hour. the break down is in accordance with Poisson process.cost of idle machine hour is $15/hour. 2 repairmen Peter an

Two person zero sum game, definatins and example

definatins and example

Seven step to a successful presentation, Seven Step to a Successful Present...

Seven Step to a Successful Presentation There are seven basic step which need to kept in mind at the time of making a presentation. How successful one is at eh end

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

Game theory-, use of game theory by state bank of india

use of game theory by state bank of india

Graphical method- minimization example, Minimization Example A ...

Minimization Example A farmer is advised to utilize at least 900 kg of mineral A and 1200 kg of mineral B to increase the productivity of crops in his fields.

Students t distribution - hypothesis testing, Normal 0 false ...

Normal 0 false false false EN-IN X-NONE X-NONE

Describe the service tax law in usa and concept of negative, Question 1 ...

Question 1 X Ltd. has Unit C which is not functioning satisfactorily. The following are the details of its fixed assets: Asset Date of acquisiti

Simplex solution, difference between simplex solution procedure for maximis...

difference between simplex solution procedure for maximisation and minimisation

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

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