Home
Class 12
MATHS
Which of the following is a linear objec...

Which of the following is a linear objective ? A) `z=ax+by` B)`z leq ax+by` C) `z gt ax+by` D)`z!=ax+by`

A

Z= ax + by

B

`Z le ax + by `

C

` Z gt ax + by `

D

` Z ne ax + by`

Text Solution

Verified by Experts

The correct Answer is:
A
Linea function Z=ax + by where , a and b are constants which has to be maximised or minimised, is called a linear objetive function.
Promotional Banner

Topper's Solved these Questions

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise EXERCISE 1 (TOPICAL PROBLEMS )(Solution of LPP Graphical Method )|15 Videos

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise EXERCISE 2 (MISCELLANEOUS PROBLEMS )|30 Videos

  • LINE

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|3 Videos

  • MATHEMATICAL LOGIC

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET CORNER|22 Videos

Similar Questions

Explore conceptually related problems

The feasible region of a system of linear inequalities is shown shaded in the following graph . If the objective function is Z = ax + by where a,b are constants and the maximum of Z occurs at points A and D then :

Evaluate each of the following algebraic expressions for x=2,\ y=-3,\ z=-2,\ a=2,\ b=3: (i) ax+by+z

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

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?

The equation of the plane through the line of intersection of the planes ax+by+cz+d=0 and a'x+b'y+c'z+d'=0 parallel to the line y=0 and z=0 is

Let the feasible region of the linear programming problem with the objective function Z = ax + by is unbounded and let M and m be the maximum and minimum value of Z, respectively. Now, consider the following statements I. M is the maximum value of Z, if the open half plane determined by ax + by gt M has no point in common with the feasible region. Otherwise, Z has no maximum value. II. mis the minimum value of Z, if the open half plane determined by ax + by lt m has no point in common with the feasible region. Otherwise, Z has no minimum value. Choose the correct option.

If we represent the linear equations x + y - z = 3, 2x + 3y + z = 10 and 3x - y - 7z = 1 in matrix form as AX = B, then A^(T) is: