LPP, Operation Research

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP
MAXIMISE Z=4X1+10X2
SUBJECT TO CONSTRAINS,
2X1+X2<50
2X1+5X2<100
2X1+3X2<90
X1, X2>0
Posted Date: 3/12/2013 8:18:21 AM | Location :







Related Discussions:- LPP, Assignment Help, Ask Question on LPP, Get Answer, Expert's Help, LPP Discussions

Write discussion on LPP
Your posts are moderated
Related Questions
1. Investigate: The Operations Strategy of your organisation or one you are familiar with and answer the following points. Does your chosen organisation have an operations

#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

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

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

AI TECHNOLOGY''S CURRENT AND POTENTIAL FUTURE APPLICATIONS

Important to Theoretical Distribution The science  of theoretical distribution  under which  the frequencies of a variable are derived by  some  mathematical  model  without

Decision making is not only the headache of management rather all of us make decisions. We daily decide about minor issues. The essential characteristics of all decisions

discuss about assignment and steps involved in it

if one no. is repeated 2-3 times in machine-1 and machine-2 what is to be prefer first

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0