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

Software, role of computer software in operation research

role of computer software in operation research

MBA, #q.2 Q.2 Six Operators are to be assigned to five jobs with the cost o...

#q.2 Q.2 Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no a

Linear Programming Problem, A paper mill produces two grades of paper viz.,...

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

Jaguar, how jaguar implements aggregate planning?

how jaguar implements aggregate planning?

Find the maximum and minimum values, Problems based on solution of a given ...

Problems based on solution of a given LPP when it has multiple optimal solution: 1.    Find the maximum and minimum values of 5x+2y, subject to the constraints -2x-3y ≤ -6

What do you mean by linear programming problem, Q1. a. What do you mean by ...

Q1. a. What do you mean by linear programming problem? Explain the steps involved in linear programming problem formulation? b. A paper mill produces two grades of paper viz., X

Regression line - correlation regression analysis, Regression Line The...

Regression Line The line  of regression  is the  line  which give the best  estimate  to the  values  of one  variable  for any  specific  values  of other  variable. For t

Solve the following linear programming graphically, Problem based on graphi...

Problem based on graphical solution of a given LPP when feasible region is bounded. 1.    Solve the following linear programming graphically; Maximize and minimize z = 60x+

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow...

Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

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