Problems based on lpp when feasible region is a line segment, Operation Research

Assignment Help:

Problems based on LPP when feasible region is a line segment or it does not exist.

1.    Maximize z = 2x+3y subject to the constraints

X + y ≤ 1

X + y ≥ 3

X,  y ≥ 0

script

solution

1.   Let z = 2x+3y

2.   Let us draw lines X +y = 1 and x + y = 3using suitable points on the graph.

3.   There is no common region satisfying the given conditions

X +y = 1 and x + y = 3


Related Discussions:- Problems based on lpp when feasible region is a line segment

Least cost methods, The NW  corner  rule  described  earlier considers only...

The NW  corner  rule  described  earlier considers only  the availability  and supply  requirements  in making  assignments. It takes  no account  of the shipping  costs  given  in

Reports - classification of documents, Reports: Report literature is a...

Reports: Report literature is an important primary source of information, particularly  for a research library. This new  medium for communication of information came into bei

Mccolvin''s principles, McColvin's Principles: L.R McColvin advanced h...

McColvin's Principles: L.R McColvin advanced his Demand and Supply Theory of Book Selection in 1925. He states, "Books in themselves are nothing. They have no more meaning tha

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

Cost- sampling decisons, Cost- sampling decisons                   ...

Cost- sampling decisons                         σ x¯ =S/√n       Where is the  standard  error of he mean is the standard devaluation of  the population and n is t

Question, Solve the following Linear Programming Problem using Simple metho...

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

Inability of nih, Inability of NIH, FDA, to Identify Conflict of Interest ...

Inability of NIH, FDA, to Identify Conflict of Interest While federal regulations require that researchers receiving NIH grants remain free of financial conflicts of interest,

Research essay, how Network Scheduling solving a real problem in a real bus...

how Network Scheduling solving a real problem in a real business .

Complete decision making process , Operation research is only a Tool of Ana...

Operation research is only a Tool of Analysis and Not the Complete Decision making Process: It should always be kept in mind that O. R alone cannot make the final decision . it

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd