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

HOMEWORK, A company uses 4 pounds of resource 1 to make each unit of X1 and...

A company uses 4 pounds of resource 1 to make each unit of X1 and 3 pounds of resource 1 to make each unit of X2. There are only 150 pounds of resource 1 available. Which of the fo

#title, WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

Linear programming, Ask question #Minimum 100 words acceptNas food produces...

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

Components included in the reseach proposal, Components Included in the Pro...

Components Included in the Proposal Personnel In case the proposal is addressed to the funding agencies, the qualifications of the key project personnel for study should be

Effect of professional development on class management, Purpose: The pu...

Purpose: The purpose of this study is to explore the effect of professional development on teachers' Lesson Planning, Class Management, Teaching Methods, Cooperation and Teac

process technolgy, 1 strategic implication of product and process decision...

1 strategic implication of product and process decisions 2 process planning and design 3 work measurement

Linear programming, Q3. Solve the following Linear Programming Problem usi...

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

Linear programimg, Solve the following Linear Programming Problem using Si...

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

Decision analysis models, These models deal with the selection of an opt...

These models deal with the selection of an optimal course of action given the possible pay offs and their associated probability of occurrence. These models are broadly

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