linear programming., Operation Research

Q3. 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/11/2013 10:57:49 PM | Location : USA







Related Discussions:- linear programming., Assignment Help, Ask Question on linear programming., Get Answer, Expert's Help, linear programming. Discussions

Write discussion on linear programming.
Your posts are moderated
Related Questions
A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

Formulation of the Problem: Before proceeding to find the solution of a problem, first of all a manager should be competent enough to form an appropriate model. To do so f

maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

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

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

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

how does it work

These models are used when one must decide the optimal time to replace equipment for one reason or the other for instance, in the case of equipment whose efficiency dete

Method of Calculation of Mean  Deviation a. Computation of Mean Deviation Individual Series : The process of computing mean  deviation in case  of individual series involves