solved the question, Operation Research

#questionthe following Linear Programming Problem using Simple method.
Maximize Z= 3x1 + 2X2
Subject to the constraints:
X1+ X2 = 4
X1 - X2 = 2
X1, X2 = 0 ..
Posted Date: 2/24/2013 6:58:05 AM | Location : USA







Related Discussions:- solved the question, Assignment Help, Ask Question on solved the question, Get Answer, Expert's Help, solved the question Discussions

Write discussion on solved the question
Your posts are moderated
Related Questions

Calculation of Standard Deviation - Continuous Series: In the continuous series the methods of calculation standard deviation is almost the same as in a discrete frequency distrib

LIMITS OF TRANSPOTATION PROBLEM


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

The influence of daily life of keeping dogs Part a) Qualitative data analysis: These activities are aimed at developing skills in basic qualitative data analysis Inte

Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as

solve the LPP using simple method, maximize z= 3x1+2x2 subject to constraints

Convenience  Sampling In  convenience  sampling  selection the researcher chooses the  sampling  units on the   basis of convince or  accessibility. It is  called  accidental