Home
Class 12
MATHS
A general linear programming problem i...

A general linear programming problem is to maximize or minimize a function f= px +qy, `p^(2)+q^(2) ne 0` subject ot `(i) x ge 0, y ge 0,(ii) a_(1)x+b_(1)ygec_(1),(iii)a_(2)x+b_(2)ylec_(2)` etc then f and (i) (ii) , (iii) etc are defined as

A

objective function

B

non negativity constraints

C

negativity constraits

D

production function

Text Solution

Verified by Experts

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

Topper's Solved these Questions

  • LINEAR PROGRAMMING GRAPHICAL METHOD

    CHHAYA PUBLICATION|Exercise Integer Answer Type|5 Videos
  • LINEAR PROGRAMMING GRAPHICAL METHOD

    CHHAYA PUBLICATION|Exercise Matrix Match Type|2 Videos
  • LINEAR PROGRAMMING GRAPHICAL METHOD

    CHHAYA PUBLICATION|Exercise Long Answer Type Question|16 Videos
  • LINEAR INEQUATIONS

    CHHAYA PUBLICATION|Exercise SAMPLE QUESTION FOR COMPETITIVE EXAMS (Assertion- Reason Type)|2 Videos
  • LOGARITHM

    CHHAYA PUBLICATION|Exercise Long Answer Type Question|12 Videos

Similar Questions

Explore conceptually related problems

Represent the following equations in matrix form: a_(1)x+b_(1)y+c_(1)=0 a_(2)x+b_(2)y+c_(2)=0

Solve the following linear programming problem graphically : min Z= 5x+7y Subject to the constraints 3x+2y ge12 2x+3y ge 13 and x ge 0, y ge 0

Knowledge Check

  • The straight line a_(1)x+b_(1)y+c_(1)=0 anda_(2)x+b_(2)y+c_(2)=0 are parallel to each other if -

    A
    `(a_(1))/(a_(2))ne(b_(1))/(b_(2))`
    B
    `(a_(1))/(b_(1))ne(b_(2))/(a_(2))`
    C
    `(a_(1))/(a_(2))=(b_(1))/(b_(2))`
    D
    `(a_(1))/(b_(1))=(b_(2))/(a_(2))`
  • If the simultaneous linear equations a_(1)x+b_(1)y+c_(1)=0 " and " a_(2)x+b_(2)y+c_(2)=0 have only one solution, then the required condition is -

    A
    `a_(1)b_(2)=a_(2)b_(1)`
    B
    `a_(1)b_(2)=b_(1)b_(2)`
    C
    `a_(1)a_(2)=b_(1)b_(2) ne c_(1)c_(2)`
    D
    `a_(1)b_(2) ne a_(2)b_(1)`
  • Similar Questions

    Explore conceptually related problems

    Solve the following linear programming problem : Minimize Z=3x_(1)+5x_(2) Subject to the constraints x_(1)+3x_(2) ge 32 x_(1)+x_(2)ge2 x_(1),x_(2)ge 0

    Let the function f: RR rarr RR be defined by, f(x) =x^(2), . Find (i) f^(-1) (25) , (ii) f^(-1) (5) , (iii) f^(-1) (-5)

    Find the minimum value of Z=3x_(1)+5x_(2) subject to x_(1) +3x_(2)ge3,x_(1)+x_(2)ge2 and x_(1),x_(2)ge0

    A functionfis defined by f(x)=2x-5. Write down the values of (i) f(0), (ii) f(7), (iii) f(-3)

    Solve graphically the following system of linear inequations - x - y le 1 , x + 2y le 8 , 2x + y ge 2 . x ge 0 , yge 0. ‘

    If (x^(2)+x+1)/(1-x) = a_(0) + a_(1)x+a_(2)x^(2)+"…." , then sum_(r=1)^(50) a_(r) equal to