Home
Class 12
MATHS
The area of the feasible region for the ...

The area of the feasible region for the following constraints `3y+xge3,xge0,yge0` will be

A

Bounded

B

Unbounded

C

Convex

D

Concave

Text Solution

Verified by Experts

The correct Answer is:
B
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    TARGET PUBLICATION|Exercise Evaluation Test|11 Videos

  • LINEAR PROGRAMMING

    TARGET PUBLICATION|Exercise Critical Thinking|28 Videos

  • LINE

    TARGET PUBLICATION|Exercise Evaluation Test|1 Videos

  • MATHEMATICAL LOGIC

    TARGET PUBLICATION|Exercise EVALUATION TEST|14 Videos

Similar Questions

Explore conceptually related problems

The area of the feasible region for the following constraints 3y +x ge 3, x ge 0, y ge 0 will be

The feasible region of the constraints 4x+2yle8,2x+5yle10 and x,yge0 is

Shaded, region of the constraints 4x+3yle12,-x+yle2,xge0,yge0 is

A vertex of a feasible region by the linear constraints 3x+4yle18,2x+3yge3 and x,yge0, is

Shaded,region of the constraints 4x+yge4,x+3yge6,x+yge3,xge0,yge0 is

Draw the diagrams of the solution sets of the following linear constraints: 3x+4yge12,x+2yle3,xle3,xge0,yge1 .

Draw the diagrams of the solution sets of the following linear constraints: 2x+y-3ge0,x-2y+1le0,xge0,yge0 .

Shaded, region of the constraints x+yge5,2x+3yle18,4x+3yle24,xge0,yge0 is

The constraints -x+yle1,-x+3yle9,xge0,yge0 defines

The region in the xy plane given by y-xle1,2x-6yle3,xge0,yge0 is

TARGET PUBLICATION-LINEAR PROGRAMMING-Competitive Thinking
  1. The optimal value of the objective function is attained at the points

    Text Solution

    |

  2. Which of the terms is not used in a linear programming problem

    Text Solution

    |

  3. The area of the feasible region for the following constraints 3y+xge3...

    Text Solution

    |

  4. The constraints -x(1)+x(2)lt 1, -x(1)+3x(2)le9, x(1), x(2)gt, 0 difine...

    Text Solution

    |

  5. Inequations 3x-yge3 and 4x - y gt 4

    Text Solution

    |

  6. The objective function of LLP defined over the convex set attains its ...

    Text Solution

    |

  7. If an LPP admits optimal solution at two consecutive vertices of a joi...

    Text Solution

    |

  8. The maximum value of P = 3x +4y subject to the constraints x+yle40,2yl...

    Text Solution

    |

  9. If 4x+5yle20,x+yge3,xge0,yge0 maximum 2x + 3y is

    Text Solution

    |

  10. The maximum of z = 5x+2y , subject to the constrainsts x+yle7,x+2yle1...

    Text Solution

    |

  11. The maximum value of 2x+y subject to 3x+5yle26and5x+3yle30,xge0,yge0...

    Text Solution

    |

  12. By graphical method, the solutions of linear programming problem maxim...

    Text Solution

    |

  13. The maximum value of 4x +5y subject to the constraints x+yle20,x+2yle...

    Text Solution

    |

  14. Max value of z equal 3x + 2y subject to x+yle3,xle2,-2x+yle1,xge0,yge...

    Text Solution

    |

  15. The point at which , the maximum value of (3x+2y) subject to the const...

    Text Solution

    |

  16. The point which provides the solution of the linear programming proble...

    Text Solution

    |

  17. The points which provides the solution to the linear programming probl...

    Text Solution

    |

  18. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  19. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  20. The minimum value of z=2z(1)+3x-(2) subjected to the constraints 2x(1)...

    Text Solution

    |