Home
Class 12
MATHS
The optimal value of the objective funct...

The optimal value of the objective function is attained at the points

A

Given by intersection of inequations with axes only

B

Given by intersection of inequations with X- axis only

C

Given by corner points of the feasible region

D

None of these

Text Solution

Verified by Experts

The correct Answer is:
C
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

In the feasible region for a LPP is ..., then the optimal value of the objective function Z= ax + by may or may not exist.

In a LPP, the objective function is always.

Objective function of an LPP is

The value of objective function is maximum under linear constraints

Which of the following statements is false? A) The feasible region is always a concave region B) The maximum (or minimum) solution of the objective function occurs at the vertex of the feasible region C) If two corner points produce the same maximum (or minimum) value of the objective function, then every point on the line segment joining these points will also give the same maximum (or minimum) two. values D) All of the above

The value of an objective function is maximum under linear constraints:

In a LPP, the maximum value of the objective function Z = ax +by is always finite.

In a LPP, the maximum value of the objective function Z = ax +by is always 0, if origin is one of the corner point of the feasible region.

TARGET PUBLICATION-LINEAR PROGRAMMING-Competitive Thinking
  1. LPP includes

    Text Solution

    |

  2. Minimize z=sum(j=1)^(n)" "sum(i=1)^(m)c("ij ")x("ij") Subject to ...

    Text Solution

    |

  3. The optimal value of the objective function is attained at the points

    Text Solution

    |

  4. Which of the terms is not used in a linear programming problem

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |