linear programming, Operation Research

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/15/2013 6:05:46 AM | 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
Problems based on solution of a given LPP when it has multiple optimal solution: 1.    Find the maximum and minimum values of 5x+2y, subject to the constraints -2x-3y ≤ -6


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

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

Tentative explanations when formulated as propositions are called hypotheses. It is very important to state the hypothesis and its anticipated consequences before star

process of operation research

Select five Operations Research techniques and describe in detail the real world application of such techniques in business decision making.

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

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

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0