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

Introductoin operational research, disadvantages of modeling in operationa...

disadvantages of modeling in operational research

Draw a network for the project adn determine the critical pa, a)Draw a netw...

a)Draw a network for the project. b)Determine the critical path. Activity Duration Activity Duration 1-2 15 5-10 22 1-3 13 6-9 33 1-4 1

Individual user interests - information resources, Individual User Interest...

Individual User Interests: More specific information about users could cover the following: Subjects and associated interest - e.g. specific subjects, allied subjects;

Uses of standard deviation - measure of dispersion, Uses of Standard D...

Uses of Standard Deviation Normal 0 false false false EN-IN X-NONE X-NONE

Construction procedure for research tool, CONSTRUCTION PROCEDURE The c...

CONSTRUCTION PROCEDURE The construction of an interview schedule or questionnaire is a time consuming task requiring considerable attention to all the details. The investig

Linear programming solution by steps for two-phase method, Solve by Steps f...

Solve by Steps for Two-Phase Method Max Z = 5x 1 + 8x 2 Subject to 3x 1 + 2x 2 ≥ 3 x 1 + 4x 2 ≥ 4 x 1 + x 2 ≤ 5 & x 1 ≥ 0, x 2 ≥ 0 Answe

Linear programming problem, a paper mill prodecs two grades of paper viz., ...

a paper mill prodecs 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

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

#, Six Operators are to be assigned to five jobs with the cost of assignmen...

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

Graphical solution procedure, Graphical Solution Procedure sample assignmen...

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages