Home
Class 12
MATHS
Which of the terms is not used in a line...

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

A

Slack variables

B

Objective function

C

Concave region

D

Feasible solution

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

Which of the term is not used in a linear programming problem ?

Which of the term is not used in a linear programming problem? A) optimal solution B)Feasible solution C)concave region D)objective functions

Linear programming problems

If the constraints in linear programming problem are changed

If the constraints in a linear programming problem are changed

Find the corner points of the feasible region of the linear programming problem;,Max Z=x : Subject to the constraints 3x+2y =0,y>=0

Objective function of a linear programming problem is

The linear inequalities or equations or restrictions on the variables of a linear programming problem are called A)linear relations B) constraints C) functions D) objective functions

TARGET PUBLICATION-LINEAR PROGRAMMING-Competitive Thinking
  1. Minimize z=sum(j=1)^(n)" "sum(i=1)^(m)c("ij ")x("ij") Subject to ...

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |