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

Meaning of a research report, Problem The important task ahead of the r...

Problem The important task ahead of the researcher is to document the entire work done in the form of a well-structured research report. Describe in brief the components of a R

Wanna solution for this, A paper mill produces two grades of paper viz., X ...

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 i

compute probabilities-transitions and transition rate, Consider a queueing...

Consider a queueing system with 1 counter, to which groups of customers arrive according to a Poisson proces with intensity l. The size of a group is 1 with probability p and 2 wit

Operation Research.., 3. Explain ‘Vogel Approximation Model (VAM)’.? answer...

3. Explain ‘Vogel Approximation Model (VAM)’.? answer please

LLp, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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 i

Li, line drawn as Y=C+1075x, when x was 2, and y was 239, given that y inte...

line drawn as Y=C+1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residualon..

Solved a.q, Solve the following Linear Programming Problem using Simple met...

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

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow...

Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

Optimal assignment, Six Operators are to be assigned to five jobs with the ...

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

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages