lp, Operation Research

#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.
Posted Date: 2/14/2013 6:09:46 AM | Location :







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

Write discussion on lp
Your posts are moderated
Related Questions
A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Inventory models deal with the problem of determination of how much to order at a point in time and when to place an order. The main objective is to minimize the sum of three

Methods  of calculation of standard deviation a. Calculation of Standard  Deviation  - Individual Series: There  are two methods of calculating standard  deviation in an ind

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

Find a minimum cost spanning arborescence rooted,

what is meant by Application Areas of Linear Programming?

Maxz=3x1-2x2 St x1 -x2>_0, 3x1-x2 _0

Inability of NIH, FDA, to Identify Conflict of Interest While federal regulations require that researchers receiving NIH grants remain free of financial conflicts of interest,

classification

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a