Home
Class 12
MATHS
The constraints -x(1)+x(2)lt 1, -x(1)+3x...

The constraints `-x_(1)+x_(2)lt 1, -x_(1)+3x_(2)le9, x_(1), x_(2)gt, 0` difines on

A

Bounded feasible space

B

Unbounded feasible space

C

Both bounded and unbounded feasible space

D

None of these

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 constraints -x_1+x_2 le 1,-x_1 +3x_2 le 9, x _1,x_2 gt 0 defines

By graphical method, the solutions of linear programming problem maximise Z=3x_(1)+5x_(2) subject to constraints 3x_(1)+2x_(2) le 18, x_(1) le 4, x_(2) le 6 x_(1) ge0,x_(2) ge 0 are

The linear programming problem : Maximize z=z=x_(1)+x_(2) subject to constraints x_(1)+2x_(2)le2000,x_(1)+x_(2)le1500,x_(2)le600,x_(1)ge0 has

Maximize z = -x_(1) + 2x_(2) Subject to -x_(1) + x_(2) le 1 -x_(1) + 2x_(2) le 4 x_(1), x_(2) le 0

Minimize z = -x_(1) + 2x_(2) Subject to -x_(1) + 3x_(2) le 10 x_(1) + x_(2) le 6 x_(1) - x_(2) le 2 and x_(1), x_(2) ge 0

For the constraint of a linear optimizing function z=x_(1)+x_(2) , " given by " x_(1)+x_(2)le1,3x_(1)+x_(2)ge3 and x_(1),x_(2)ge0

Maximize z = 7x_(1) + 3x_(2) by graphical method Subjecto to x_(1) + 2x_(2) ge 3 x_(1) + x_(2) le 4 0 le x_(1) le (5)/(2) and 0 le x_(2) le (3)/(2)

By graphical method, the solutions of linear programming problem maximum Z = 3x_1 + 5x_2 subject to constraints 3x_1+2x_2 le 18 x_1 le 4, x_2 le 6,x_1 ge 0, x_2 ge 0

Examine the continuity of f(x) = {(2x+1,x le 0),(1-3x,x gt 0):} is continuous at x=0

TARGET PUBLICATION-LINEAR PROGRAMMING-Competitive Thinking
  1. Which of the terms is not used in a linear programming problem

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  20. The minimum value of the objective function Z=2x+10y for linear const...

    Text Solution

    |