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

LPP, . 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

Reference books - classification of documents, Reference Books: Defini...

Reference Books: Definition According to William Katz (1969) a Reference book generally has the following qualities: It is a miscellany of information organised for quick

transportsation, vogel

vogels

Linear programming, Use Big M method to Maximize(Z)=3_(x_1 )+2_(x_2 ) Subj...

Use Big M method to Maximize(Z)=3_(x_1 )+2_(x_2 ) Subject to 3_(x_1 )+?1.5?_(x_2 )=30 x_1+x_2=20 x_1=0 x_2=0

A. Discuss the methodology of Operations Research., a. Discuss the methodol...

a. Discuss the methodology of Operations Research.

Line balancing, what happen if line balancing does not exist

what happen if line balancing does not exist

Sequencing, how the sequencing techniques help the manager

how the sequencing techniques help the manager

Decide upon the objective , Decide upon the Objective What is it...

Decide upon the Objective What is it that you aim to achieve the end of the presentation ? your objective should be crystal clear. Do not stray or move a ways

Use of the graphs, Use of the Graphs a . It simplifies the complexi...

Use of the Graphs a . It simplifies the complexities of large numbers or that of large mass of data. In general graphical or some other method or representation is ad

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