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:
bounded
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

The feasible region of the inequality x+y le 1" and "x-y le 1 lies in …….. quadrants.

The correct points of the feasible region determined by the following system of linear inequalities, 2x+y le 10, x+3y le 15, x, y ge 0 , are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q gt 0 . Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is ..........

Solve the following system of linear inequalities graphically. x+y ge 5" "…(1) x-y le 3" "…(2)

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

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

Separation of Motion of a system of particles into motion of the centre of mass and motion about the centre of mass : (a) Show p=p_(i).+m_(i)V where p_(i) is the momentum of the ith particle (of mass m_(i) ) and p_(i).=m_(i)v_(i). . Note v_(i). is the velocity of the i^(th) particle relative to the centre of mass Also, prove using the definition of the centre of mass Sigmap_(i).=0 (b) Show K=K.+(1)/(2)MV^(2) where K is the total kinetic energy of the system of particles, K. is the total kinetic energy of the system when the particle velocities are taken with respect to the centre of mass and (1)/(2)MV^(2) is the kinetic energy of the translation of the system as a whole (i.e. of the centre of mass motion of the system). The result has been used in Sec. 7.14). (c ) Show vecL=vecL.+vecRxxvec(MV) where vecL.=Sigmavec(r_(i)).xxvec(p_(i)). is the angular momentum of the system about the centre of mass with velocities taken relative to the centre of mass. Remember vec(r._(i))=vec(r_(i))-vecR , rest of the notation is the velcities taken relative to the centre of mass. Remember vec(r._(i))=vec(r_(i))-vecR rest of the notation is the standard notation used in the chapter. Note vecL , and vec(MR)xxvecV can be said to be angular momenta, respectively, about and of the centre of mass of the system of particles. (d) Show vec(dL.)/(dt)=sumvec(r_(i).)xxvec(dp.)/(dt) Further, show that vec(dL.)/(dt)=tau._(ext) where tau._(ext) is the sum of all external torques acting on the system about the centre of mass. (Hint : Use the definition of centre of mass and Newton.s Thrid Law. Assume the internal forces between any two particles act along the line joining the particles.)

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

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

A uniform magnetic field is restricted within a region of radius r. The magnetic field changes with time at a rate (dvecB)/(dt) . Loop 1 of radius R gt r encloses the region r and loop 2 of radius R is outside the region of magnetic field as shown in the figure below. Then the emf generated is

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

    |