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

Applications of statistics in management, In a business, statis...

In a business, statistics is used to study the demand and market characteristics of the product or service being sold. In fact, market research

Discuss the term group decision making, a. Determine the following with res...

a. Determine the following with respect to decision making approaches: (i) Group decision making (ii) Directive, analytic, conceptual and behavioral decision making styles (8

Explain the process of problem identification with an exampl, Question ...

Question 1 Explain the process of problem identification with an example 2 Interview method involves a dialogue among the Interviewee and the Interviewer. Describe the inter

Assignment 2012, Problem 1 (Problem 23, page 507) At a machine tool plant, ...

Problem 1 (Problem 23, page 507) At a machine tool plant, five jobs must be completed each day. The time it takes to do each job depends on the machine used to do the job. If a mac

Linear Programming, A paper mill produces two grades of paper viz., X and Y...

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

Goal programming, Goal Programming This provides a more realistic model...

Goal Programming This provides a more realistic model. In a modern setting, profit maximization may not be the only objective of a business concern. Other objectives or goals c

Simplex method of LP, MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 = 200 - ...

MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 = 200 - resource 1 3 X1 + 7 X2 = 175 - resource 2 X1, X2 = 0 2. How many units of resource 1 are cons

Making decision - hypothesis testing, Making Decision Lastly a deci...

Making Decision Lastly a decision should be arrived as to whether the null hypothesis is to be accepted or rejected. In this regard the value of the test statistic

What do you understand by the term queueing theory, Question: (a) (i) W...

Question: (a) (i) What do you understand by the term ‘queueing theory'? Give two real life examples to illustrate your answer. (ii) Outline the five components involved in

Llp, Solve the following Linear Programming Problem using Simple method. Ma...

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

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages