linear programming, 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

Decision analysis models, These models deal with the selection of an opt...

These models deal with the selection of an optimal course of action given the possible pay offs and their associated probability of occurrence. These models are broadly

Linear programming problem, A paper mill produces two grades of paper viz.,...

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

CORE TECHNOLOGY TO WATCH IN FUTURE, AI TECHNOLOGY''S CURRENT AND POTENTIAL ...

AI TECHNOLOGY''S CURRENT AND POTENTIAL FUTURE APPLICATIONS

Replacement theory, if the year or age is given from 0 how to solve then?...

if the year or age is given from 0 how to solve then?

Lp, #question.Solve the following Linear Programming Problem using Simple m...

#question.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.

MINIMIZATION., Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=2...

Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=28 2??1+12??2=24 ??1,??2=0 a. A basic solution of the constraint equations of this problem has how many basic variables,

#title, WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

Simple graph-correlation and regression analysis, Simple Graph The val...

Simple Graph The values of the two variables are plotted on a graph paper. We get two curves one for x variables and another for y  variables. These  two curves reveal the dir

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

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