Home
Class 12
MATHS
A corner point of a feasible region is a...

A corner point of a feasible region is a point in the region which is the ……….. of two boundary lines.

Text Solution

Verified by Experts

The correct Answer is:
is common intersecting point
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise MULTIPLE CHOICE QUESTIONS|42 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 12|14 Videos

  • LINEAR PROGRAMMING

    KUMAR PRAKASHAN|Exercise TEXTBOOK ILLUSTRATIONS FOR PRACTICE WORK|11 Videos

  • INVERSE TRIGONOMETRIC FUNCTIONS

    KUMAR PRAKASHAN|Exercise PRACTICE PAPER - 2 (SECTION - D)|2 Videos

  • MATRICES

    KUMAR PRAKASHAN|Exercise Practice Paper - 3 (Section - D)|1 Videos

Similar Questions

Explore conceptually related problems

In a LPP if the objective function z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ………. Value.

The corner points of the feasible region determined by the following sytem of linear inequalities: 2x+yle10, x+3yle15, x, yge0 are (0,0),(5,0),(3,4) and (0,5). Let Z=px+qy where p,qge0 . Condition on p and q so that the maximum of Z occurs at both (3,4) and (0,5) is

The corner points of the feasible region determined by the system of linear constraints are (0,10), (5,5), (15,15), (0,20). Let Z = px + qy where p, q gt 0 . Condition on p and q so that the maximum of z occurs at both the points (15,15) and (0,20) is

The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is z = 4x + 3y. Compare the quantity in Column A and Column B

PQ and PR are two infinite rays. QAR is an arc. Point lying in the shaded region excluding the boundary satisfies.

Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q gt 0 . Condition on p and q, so that the maximum of Z occurs at (3, 0) and (1, 1) is ……….

Which series is found in the ultraviolet region ?

In a simple cubic cell, each point on a corner is shared by

KUMAR PRAKASHAN-LINEAR PROGRAMMING-SOLUTIONS OF NCERT EXEMPLAR PROBLEMS
  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 Figure Let z = -3x - 4y ...

    Text Solution

    |

  3. The feasible solution for a LPP is shown in Figure Let z = -3x - 4y ...

    Text Solution

    |

  4. The corner points of the bounded feasible region are (0, 0), (0, 8), (...

    Text Solution

    |

  5. The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y...

    Text Solution

    |

  6. The feasible region for an LLP is shown in the Figure. Let z = 3x - 4y...

    Text Solution

    |

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

    Text Solution

    |

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

    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 are...

    Text Solution

    |

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

    Text Solution

    |

  12. If the feasible region for a LPP is …………, then the optimal value of th...

    Text Solution

    |

  13. In a LPP if the objective function z = ax + by has the same maximum va...

    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 region which is ...

    Text Solution

    |

  16. The feasible region for an LLP is always a …….. polygon.

    Text Solution

    |

  17. If the feasible region for a LPP is unbounded, maximum or minimum of t...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |