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

Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    ML KHANNA|Exercise Fill in the blanks|9 Videos

  • LINEAR PROGRAMMING

    ML KHANNA|Exercise Question|2 Videos

  • LINEAR PROGRAMMING

    ML KHANNA|Exercise Self Assessment Test|8 Videos

  • LIMITS, CONTINUITY AND DIFFERENTIABILITY

    ML KHANNA|Exercise MISCELLANEOUS EXERCISE (ASSERTION/ REASONS) |3 Videos

  • LOGARITHMS AND SURDS

    ML KHANNA|Exercise Miscellaneous exercise|3 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

ML KHANNA-LINEAR PROGRAMMING -Practice Exercises
  1. Maximize z = 3x + 2y by graphical method Subject to x + 2y ge 2 x...

    Text Solution

    |

  2. Minimize z = -x + 2y x + y le 6 x - y le 2 and x, y ge 0

    Text Solution

    |

  3. Minimize and Maximize Z = 5x + 2y , subject to the following constrain...

    Text Solution

    |

  4. Minimize z = x + 3y Subject to x + y le 5 2x + y ge 4 x + 5y g...

    Text Solution

    |

  5. Maximize z = -x(1) + 2x(2) Subject to -x(1) + x(2) le 1 -x(1) + ...

    Text Solution

    |

  6. Maximize z = 5x(1) + 3x(2) Subject to 3x(1) + 5x(2) le 15 5x(1) ...

    Text Solution

    |

  7. Maximize z = 7x(1) + 3x(2) by graphical method Subjecto to x(1) + ...

    Text Solution

    |

  8. Maximize z = x(1) + 3x(2) Subject to 3x(1) + 6x(2) le 8 5x(1) + ...

    Text Solution

    |

  9. Minimize z = -x(1) + 2x(2) Subject to -x(1) + 3x(2) le 10 x(1) +...

    Text Solution

    |

  10. The objective function z = 4x + 3y can be maximized subjected to the c...

    Text Solution

    |

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

    Text Solution

    |

  12. The maximum value of z = 4x +2y subject to the constraints 2x+3yle18,x...

    Text Solution

    |

  13. A firm manufactures two products A and B on which the profit earned pe...

    Text Solution

    |

  14. A factory makes cricket bats and tennis rackets. A cricket bat takes 1...

    Text Solution

    |

  15. A factory makes cricket bats and tennis rackets. A cricket bat takes 1...

    Text Solution

    |

  16. A factory makes cricket bats and tennis rackets. A cricket bat takes 1...

    Text Solution

    |

  17. Solve the problem graphically Maximize 8000 x + 7000 y Subject to...

    Text Solution

    |

  18. A transport company has offices in five localities A, B, C, D and E. S...

    Text Solution

    |

  19. A company owns two coal mines, A and B say. The production in these mi...

    Text Solution

    |

  20. A company owns two coal mines, A and B say. The production in these mi...

    Text Solution

    |