Home
Class 12
MATHS
A feasible region of a system of linear ...

A feasible region of a system of linear inequalities is said to be ..., if it can be enclosed within a circle.

Text Solution

Verified by Experts

The correct Answer is:
N/a

A feasible region of a system of linear inequalities is said to be bounded, if it can be enclosed within a circle.
Promotional Banner

Topper's Solved these Questions

  • INVERSE TRIGONOMETRIC FUNCTIONS

    NCERT EXEMPLAR|Exercise Inverse Trigonometric Functions|55 Videos
  • MATRICES

    NCERT EXEMPLAR|Exercise Matrices|101 Videos

Similar Questions

Explore conceptually related problems

The feasible region of a system of linear inequalities is shown below. If the objective function is maximise Z = 25x + 15y, then the maximum value of Z occurs at:

The feasible region of a system of linear inequalities is shown shaded in the following graph . If the objective function is Z = ax + by where a,b are constants and the maximum of Z occurs at points A and D then :

The feasible region of a sytem of linear inequations is shown below. If Z = 2x + y, then the minimum value of Z is:

The feasible region by a system of linear inequalities is shown shaded in the given graph. If Z = 4x - 6y, then Z_("min") =

the corner points of the feasible region of a system of linear inequalities 3x + 5y le 15, 5x + 2y ge 10, x ge 0, y ge 0 , are:

The feasible region of a system of linear inequations is shown shaded in the following figure If Z =4x +3y," then "Z_(max) - Z_(min)=

If the corner points of a feasible region of system of linear inequalities are (15,20) (40,15) and (2,72) and the objective function is Z = 6x + 3y then Z_(max) - Z_(min) =

The corner points of the feasible region of a system of linear inequalities are (0, 0), (4,0), (3,9), (1, 5) and (0, 3). If the maximum value of objective function, Z = ax + by occurs at points (3, 9) and (1, 5), then the relation between a and b is:

Which of the following is a corner point of the feasible region of system of linear inequations 2x + 3y lt=6 , x + 4y lt= 4 and x, y gt= 0 ?

Solve the system of linear inequations: x + 2y le 10, 2x + y le 8 .

NCERT EXEMPLAR-LINEAR PROGRAMMING-Linear Programming
  1. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  2. The feasible solution for a LPP is shown in following figure. Let Z=3x...

    Text Solution

    |

  3. Refers to question 27. Maximum of Z occurs at

    Text Solution

    |

  4. Refers to question 7, maximum value of Z+minimum value of Z is equal t...

    Text Solution

    |

  5. The feasible region for an LPP is shown in the following figure. Let F...

    Text Solution

    |

  6. Refers to question 30. Minimum value of F is

    Text Solution

    |

  7. Corner points of the feasible region for an LPP are (0,2),(3,0),(6,0),...

    Text Solution

    |

  8. Refers to question 32, maximum of F-minimum of F is equal to

    Text Solution

    |

  9. Corner points of the feasible region determined by the system of linea...

    Text Solution

    |

  10. In a LPP, the linear inequalities or restrictions on the variables cal...

    Text Solution

    |

  11. In a LPP, the objective function is always.

    Text Solution

    |

  12. In the feasible region for a LPP is ..., then the optimal value of the...

    Text Solution

    |

  13. In a LPP, if the objective function Z=ax+by has the same maximum value...

    Text Solution

    |

  14. A feasible region of a system of linear inequalities is said to be ......

    Text Solution

    |

  15. A corner point of a feasible region is a point in the reqion which is ...

    Text Solution

    |

  16. The feasible region for an LPP is always a..polygon

    Text Solution

    |

  17. If the feasibile region for a LPP is undoubed, maximum or minimum of t...

    Text Solution

    |

  18. Maximum value of the objective function Z = ax +by in a LPP always occ...

    Text Solution

    |

  19. In a LPP, the maximum value of the objective function Z = ax +by is al...

    Text Solution

    |

  20. In a LPP, the maximum value of the objective function Z = ax +by is al...

    Text Solution

    |