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

Why two regression lines - correlation regression analysis, Why Two regress...

Why Two regression Lines Once regression line  cannot  minimize the sum  of square of deviations  for both  the x and Y series  unless the relationship  between  them  indicat

Techniques, explain the different techniques as operation research

explain the different techniques as operation research

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

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

Characteristics - probability distribution , Characteristics a. Discr...

Characteristics a. Discrete Distribution: Like  binomial  distribution it is  also a  discrete probability  i e,  occurrences can be  described  by a random  variable. b.

What do you mean by linear programming problem, Q1. a. What do you mean by ...

Q1. a. What do you mean by linear programming problem? Explain the steps involved in linear programming problem formulation? b. A paper mill produces two grades of paper viz., X

First paper, discuss the seauencing decision problem for n jobs on two and ...

discuss the seauencing decision problem for n jobs on two and three machines

LPP, USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJE...

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

Graphs of time series, Graphs of Time Series A time  series  is a sequ...

Graphs of Time Series A time  series  is a sequence of values  corresponding  to successive points  of time. Time  series  are  graphed  with time  on the x axis  and the  oth

Assignment problem, a c++ program to implement assignment problem??????????...

a c++ program to implement assignment problem???????????

Write Your Message!

Captcha
Free Assignment Quote

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd