question, 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/20/2013 8:35:36 AM | Location : USA







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

Write discussion on question
Your posts are moderated
Related Questions
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

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming 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

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

main components of linear programming

500 word summary written in third person on predictions of how current healthcare reform polocies will impact the future of healthcare

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

You are a manager at a medium sized manufacturing operation that sells a customized product directly to the consumers and the data pattern is linear but it can have the occasion ra

b. 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 pape