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
Case  Study - Data Analysis Sandarsen  inc was testing new  packaging  and a few  recipe  for a family  desert cookie  that had  been  on the  market for several years. It wa

The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch

Discuss the methodology of operation research

Normal 0 false false false EN-IN X-NONE X-NONE

Research Abstracts Abstracts of researches completed are available from the followings publications: a. ICSSR Research Abstracts: contain abstracts of research projects


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

Family Application specialises in selling major appliances for use in kitchen remodelling.  One of its more popular items is the SubZero refrigerator.  Over the past 40 weeks, the


What kind of research situation do the two new brands present for Mr. Lynn company?