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

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

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Components included in the reseach proposal, Components Included in the Pro...

Components Included in the Proposal Personnel In case the proposal is addressed to the funding agencies, the qualifications of the key project personnel for study should be

Optimal assigment, #quesSix Operators are to be assigned to five jobs with ...

#quesSix 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 assig

project management , Project Management Your data need to be orga...

Project Management Your data need to be organized in such a way that access to them is both quick and accurate. In achieving this a good qualitative analysis progra

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Assignment, discuss about assignment and steps involved in it

discuss about assignment and steps involved in it

Solution transportation problem, asm-method

asm-method

Linear programming, Solve the following Linear Programming Problem using Si...

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

Impact of operation research, impact of operation research

impact of operation research

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