Home
Class 12
MATHS
Objective function of an LPP is...

Objective function of an LPP is

A

A constraint

B

A function to be opptimised

C

A relation between the variables

D

None of these

Text Solution

Verified by Experts

The correct Answer is:
A, B
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    CBSE COMPLEMENTARY MATERIAL|Exercise ONE MARKS QUESTIONS|8 Videos
  • INVERSE TRIGONOMETRIC FUNCTIONS

    CBSE COMPLEMENTARY MATERIAL|Exercise 4 MARK QUESTIONS|31 Videos
  • MATRICES AND DETERMINANTS

    CBSE COMPLEMENTARY MATERIAL|Exercise SIX MARK QUESTIONS|20 Videos

Similar Questions

Explore conceptually related problems

Objective function of a LLP is (A) a constraint (B) a function to be optimized (C) a relation between the variables (D) none of these

Objective function of LPP is a relation between the decision variables. (True/False)

Knowledge Check

  • The objective function off LPP defined over the convex set attains it optimum value at

    A
    tleast two off the corner value at
    B
    all the corner points
    C
    atleast one of the corner points
    D
    none of the corner points
  • Objective function of a linear programming problem is

    A
    always a non-negative constraint
    B
    a relation between the variables
    C
    a function to be optimized
    D
    only a one to many relation
  • The objective function of LLP defined over the convex set attains its optimum value at

    A
    At least two of the corner points
    B
    All the corner points
    C
    At least one of the corner points
    D
    None of the corner points
  • Similar Questions

    Explore conceptually related problems

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

    Optimal function of a LPP is a function to be optimised.

    Maximum value of the objective function Z = ax +by in a LPP always occurs at only one corner point of the feasible region.

    Which of the folowing cannot be considered as the objective function of a linear programming problem ?

    Consider the following statements I. If the feasible region of an LPP is undbounded then maximum or minimum value of the obJective function Z = ax + by may or may not exist . II. Maximum value of the objective function Z = ax + by in an LPP always occurs at only one corner point of the feasible region. Ill. In an LPP, the minimum value of the objective function Z = ax + by is always 0, if origin is one of the corner point of the feasible region. IV. In an LPP, the maximum value of the objective function Z = ax + by is always finite. Which of the following statements are true?