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

Metholodolgy, metholodolgy of operational research

metholodolgy of operational research

Lcm, one example

one example

Simplex method, Solve the following Linear Programming Problem using Simple...

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

LPP using Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

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

Institutional Characteristics - information resources, Institutional Charac...

Institutional Characteristics:  An approach to an understanding of the fields of interest of individuals to be served and of the organisation as a whole could begin by acquiri

Analytical and decision- making skills, This assessment aims to provide stu...

This assessment aims to provide students with the opportunity to hone their analytical and decision- making skills. It also aims to help students develop their ability to think cre

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

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