M

Mr. Dubey • 65.25K Points
Coach 

Q. In linear programming problem if all constraints are less than or equal to, then the feasible region is

(A) Above lines
(B) Below the lines
(C) Unbounded
(D) None of the above
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The term synchronous means _

Q. In E-R diagram generalization is represented by

Q. The record of outcomes produced on a specific job function or activity during a specific time period is called

Q. Beyond IP, UDP provides additional services such as _______

Q. What is the running time of Hershberger algorithm?

Q. What is the largest number of data inputs which a data selector with two control inputs can have ?

Q. Dual-stack approach refers to

Q. Extreme values that occur infrequently are called as___________.

Q. Which algorithm among- MARS, Blowfish, RC6, Rijndael and Serpent -was chosen as the AES algorithm?

Q. What is the range of microSD card that is connected externally?

Question analytics