operations research, Mathematics

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/13/2013 2:52:37 PM | Location : USA







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

Write discussion on operations research
Your posts are moderated
Related Questions
kolushushi borrowed tsh 250000/- and paid135000/- as interest in 3 years. what rate of interest was paid


Write Prim's Algorithm.   Ans: Prim's algorithm to find out a minimum spanning tree from a weighted graph in step by step form is given below.  Let G = (V, E) be graph and S




Consider the following linear equations. x1-3x2+x3+x4-x5=8 -2x1+6x2+x3-2x4-4x5=-1 3x1-9x2+8x3+4x4-13x5=49

The mode - It is one of the measures of central tendency. The mode is defined as a value in a frequency distribution that has the highest frequency. Occasionally a single valu

similarities between rectangle & parallelogram

how many sides does a regular hexagon have?