Home
Class 12
MATHS
Choose the correct answer from the brack...

Choose the correct answer from the bracket.If an LPP is consistent,then its feasible region is always

A

Bounded

B

Unbounded

C

Convex region

D

Concave region

Text Solution

Verified by Experts

Promotional Banner

Topper's Solved these Questions

  • INVERSE TRIGNOMETRY

    MAXIMUM PUBLICATION|Exercise EXAMPLE|42 Videos

  • MATRICES

    MAXIMUM PUBLICATION|Exercise EXAMPLE|119 Videos

Similar Questions

Explore conceptually related problems

Choose the correct answer from the bracket. if cos^-1x=y ,then y is equal to

Choose the correct answer from the bracket. cos(tan^-1x),|x|<1 is equal to

Choose the correct answer from the bracket. If x=sin t and y= cos t, then dy/dx is equal to ....

Choose the correct answer from the bracket. Verify your answer. int_0^(n/2)sinxdx

Choose the correct answer from the bracket. If x=at^2 ,y=2at, then the value of dy/dx at t=1 is

MAXIMUM PUBLICATION-LINEAR PROGRAMMING-EXAMPLE
  1. A factory makes tennis rackets and bats,A tennis racket takes 1.5 hour...

    Text Solution

    |

  2. Two godowns A and B have grains capacity of 100 quintals and 50 quinta...

    Text Solution

    |

  3. Choose the correct answer from the bracket.If an LPP is consistent,the...

    Text Solution

    |

  4. Maximise Z=2x+3y subject to the constraints x+y<4,x>0,y>0

    Text Solution

    |

  5. The graph of linear programing problem is given below.The shaded regio...

    Text Solution

    |

  6. The graph of linear programing problem is given below.The shaded regio...

    Text Solution

    |

  7. The graph of linear programing problem is given below.The shaded regio...

    Text Solution

    |

  8. The graph of linear programing problem is given below.The shaded regio...

    Text Solution

    |

  9. The graph of linear programing problem is given below.The shaded regio...

    Text Solution

    |

  10. A diet is to contain atleast 80 units of vitamin A and 100 units of mi...

    Text Solution

    |

  11. Consider the linear programming problem, Maximise, Z=x+y,2x+y-3le0,x...

    Text Solution

    |

  12. Consider the linear programming problem, Maximize, Z=x+y, subject to...

    Text Solution

    |

  13. Consider the linear programming problem, Maximise, Z=x+y, subject to...

    Text Solution

    |

  14. Consider the LPP Minimise,Z=200x+500y x+2yge10,3x+4yle24,xge0,yge0 ...

    Text Solution

    |

  15. Consider the LPP Minimise,Z=200x+500y x+2yge10,3x+4yle24,xge0,yge0 ...

    Text Solution

    |

  16. Consider the LPP Minimize,Z=200x+500y x+2yge10,3x+4yle24,xge0,yge0 ...

    Text Solution

    |

  17. Consider the LPP Maximise, Z=5x+3y Subject to,3x+5yle15,5x+2yle10,...

    Text Solution

    |

  18. Consider the LPP Maximise, Z=5x+3y Subject to,3x+5yle15,5x+2yle10,...

    Text Solution

    |

  19. Consider the LPP Maximise, Z=5x+3y Subject to,3x+5yle15,5x+2yle10,...

    Text Solution

    |

  20. Consider the linear programming problem: Minimise Z=3x+9y subject ...

    Text Solution

    |