The region of feasible solution of a linear programming problem has a ............... property in geometry, provided the feasible solution of the problem exists. (A) concavity (B) convexity (C) quadratic (D) polyhedron

The region of feasible solution of a linear programming problem has a ............... property in geometry, provided the feasible solution of the problem exists. (A) concavity (B) convexity (C) quadratic (D) polyhedron
by

1 Answer

Answer :

(B) convexity
by

Related questions

If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have (A) feasible solution (B) alternative solution (C) no feasible solution at all (D) no bounded solution at all

Description : If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have (A) feasible solution (B) alternative solution (C) no feasible solution at all (D) no bounded solution at all 

Last Answer : (C) no feasible solution at all

A basic feasible solution of a linear programming problem is said to be ............... if at least one of the basic variable is zero. (A) degenerate (B) non-degenerate (C) infeasible (D) unbounded

Description : A basic feasible solution of a linear programming problem is said to be ............... if at least one of the basic variable is zero. (A) degenerate (B) non-degenerate (C) infeasible (D) unbounded

Last Answer : (A) degenerate 

Gratings is associated with the measurement of (A) Linear displacement (B) Concavity/convexity (C) Surface texture (D) Flatness

Description : Gratings is associated with the measurement of (A) Linear displacement (B) Concavity/convexity (C) Surface texture (D) Flatness

Last Answer : Option A

If the feasible region of a linear programming problem is empty, the solution is .................... a. Unbounded b. Infeasible c. Infeasible d. Alternative

Description : If the feasible region of a linear programming problem is empty, the solution is .................... a. Unbounded b. Infeasible c. Infeasible d. Alternative

Last Answer : b. Infeasible

When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .............................. a. Infeasible b. Unbounded c. Degenerate d. Non-degenerate

Description : When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .............................. a. Infeasible b. Unbounded c. Degenerate d. Non-degenerate

Last Answer : c. Degenerate

62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above

Description : 62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above

Last Answer : b. Feasible region should have a line segment

The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is (A) 76 (B) 80 (C) 90 (D) 96

Description : The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is  (A) 76 (B) 80 (C) 90 (D) 96

Last Answer : (B) 80

A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced

Description : A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced 

Last Answer : (A) degenerate

The initial basic feasible solution of the following transportion problem : Image then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82

Description : The initial basic feasible solution of the following transportion problem : then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82

Last Answer : (A) 76

Consider the following transportation problem: Image The initial basic feasible solution of the above transportation problem using Vogel’s Approximation Method(VAM) is given below: The solution of the above problem: (A) is degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution

Description : Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation Method(VAM) is given below: The solution of the ... degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution

Last Answer : (B) is optimum solution

Consider the following transportation problem : The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is : (A) 1450 (B) 1465 (C) 1480 (D) 1520

Description : Consider the following transportation problem :  The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is : (A) 1450 (B) 1465 (C) 1480 (D) 1520

Last Answer : (B) 1465

61. If a non-redundant constraint is removed from an LP problem then a. Feasible region will become larger b. Feasible region will become smaller c. Solution will become infeasible d. None of the above

Description : 61. If a non-redundant constraint is removed from an LP problem then a. Feasible region will become larger b. Feasible region will become smaller c. Solution will become infeasible d. None of the above

Last Answer : a. Feasible region will become larger

If the loading on a pre-stressed rectangular beam, is uniformly distributed, the tendon to be provided should be. (A) Straight below centroidal axis (B) Parabolic with convexity downward (C) Parabolic with convexity upward (D) Straight above centroidal axis

Description : If the loading on a pre-stressed rectangular beam, is uniformly distributed, the tendon to be provided should be. (A) Straight below centroidal axis (B) Parabolic with convexity downward (C) Parabolic with convexity upward (D) Straight above centroidal axis

Last Answer : Answer: Option B

The convexity provided to the carriageway between the crown and edge of the pavement, is known as (A) Super-elevation (B) Camber (C) Height of the pavement (D) None of these

Description : The convexity provided to the carriageway between the crown and edge of the pavement, is known as (A) Super-elevation (B) Camber (C) Height of the pavement (D) None of these

Last Answer : Answer: Option B

A simply supported rectangular beam is uniformly loaded and is prestressed. The tendon provided for prestressing should be (a) Straight, above centroidal axis (b) Straight, below centroidal axis (c) parabolic, with convexity upward (d) Parabolic, with convexity downward

Description : A simply supported rectangular beam is uniformly loaded and is prestressed. The tendon provided for prestressing should be (a) Straight, above centroidal axis (b) Straight, below centroidal axis (c) parabolic, with convexity upward (d) Parabolic, with convexity downward

Last Answer : (d) Parabolic, with convexity downward

64. If the feasible region of a LPP is empty, the solution is _______ a. Infeasible b. Unbounded c. Alternative d. None of the above

Description : 64. If the feasible region of a LPP is empty, the solution is _______ a. Infeasible b. Unbounded c. Alternative d. None of the above

Last Answer : a. Infeasible

58. While solving a LP model graphically, the area bounded by the constraints is called a. Feasible region b. Infeasible region c. Unbounded solution d. None of the above

Description : 58. While solving a LP model graphically, the area bounded by the constraints is called a. Feasible region b. Infeasible region c. Unbounded solution d. None of the above

Last Answer : a. Feasible region

The student marks should not be greater than 100. This is (A) Integrity constraint (B) Referential constraint (C) Over-defined constraint (D) Feasible constraint

Description : The student marks should not be greater than 100. This is (A) Integrity constraint (B) Referential constraint (C) Over-defined constraint (D) Feasible constraint

Last Answer : (A) Integrity constraint

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

49. A feasible solution to an LP problem a. Must satisfy all of the problem’s constraints simultaneously b. Need not satisfy all of the constraints, only some of them c. Must be a corner point of the feasible solution d. Must optimize the value of the objective function

Description : 49. A feasible solution to an LP problem a. Must satisfy all of the problem’s constraints simultaneously b. Need not satisfy all of the constraints, only some of them c. Must be a corner point of the feasible solution d. Must optimize the value of the objective function

Last Answer : a. Must satisfy all of the problem’s constraints simultaneously

Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above

Description : Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above

Last Answer : d. All of the above

Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these

Description : Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these

Last Answer : a. VAM

The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1

Description : The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1

Last Answer : c. m +n – 1

Classify the following as a constant, linear, quadratic and cubic polynomials . -Maths 9th

Description : Classify the following as a constant, linear, quadratic and cubic polynomials . -Maths 9th

Last Answer : (i) Polynomial 2 - x2 + x3 is a cubic polynomial, because maximum exponent of x is 3. (ii) Polynomial 3x3 is a cublic polynomial, because maximum exponent of x is 3. (iii) Polynomial 5t -√7 is a ... exponent of t is 2. (x) Polynomial √2x-1 is a linear polynomial, because maximum exponent of x is 1.

Classify the following as a constant, linear, quadratic and cubic polynomials . -Maths 9th

Description : Classify the following as a constant, linear, quadratic and cubic polynomials . -Maths 9th

Last Answer : (i) Polynomial 2 - x2 + x3 is a cubic polynomial, because maximum exponent of x is 3. (ii) Polynomial 3x3 is a cublic polynomial, because maximum exponent of x is 3. (iii) Polynomial 5t -√7 is a ... exponent of t is 2. (x) Polynomial √2x-1 is a linear polynomial, because maximum exponent of x is 1.

Which of the following is the correct identification of the polynomial: a) Rubina says it‘s a linear polynomial. b) Shruti calls it a quadratic polynomial. c) Both calls it a trinomial. d) Both b) and c) are correct.

Description : Which of the following is the correct identification of the polynomial: a) Rubina says it‘s a linear polynomial. b) Shruti calls it a quadratic polynomial. c) Both calls it a trinomial. d) Both b) and c) are correct.

Last Answer : d) Both b) and c) are correct.

Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these

Description : Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these

Last Answer : d. None of the these

Can you find the slick solution to this geometry problem?

Description : Can you find the slick solution to this geometry problem?

Last Answer : 2,5?

________ which is a subclass of a linear programming problem(LPP) a. Programming problem b. Transportation problem c. Computer problem d. All of the above

Description : ________ which is a subclass of a linear programming problem(LPP) a. Programming problem b. Transportation problem c. Computer problem d. All of the above

Last Answer : b. Transportation problem

Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these

Description : Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these

Last Answer : b. Dual

In Linear Programming Problem, degeneracy occurs in ................. stages. a. One b. Two c. Three d. Four

Description : In Linear Programming Problem, degeneracy occurs in ................. stages. a. One b. Two c. Three d. Four

Last Answer : b. Two

The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b

Description : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b

Last Answer : b. A travelling salesman problem

Which of the following is the mode of settlement of securities wherein the transfer of securities and funds happen simultaneously? A. Delivery versus Payment (DvP) B. Duration C. Convexity D. All of the Above E. None of the Above

Description : Which of the following is the mode of settlement of securities wherein the transfer of securities and funds happen simultaneously? A. Delivery versus Payment (DvP) B. Duration C. Convexity D. All of the Above E. None of the Above

Last Answer : A. Delivery versus Payment (DvP) Explanation: Delivery versus Payment (DvP) is the mode of settlement of securities wherein the transfer of securities and funds happen simultaneously. ... securities are not delivered and vice versa. DvP settlement eliminates the settlement risk in transactions.

State weather the following statement is true or false for EJB. 1. EJB exists in the middle-tier 2. EJB specifies an execution environment 3. EJB supports transaction processing A) 1-true, 2. true, 3. true B) 1- true, 2. false, 3. true C) 1- false, 2- false, 3- false D) 1-true, 2-true, 3-false

Description : State weather the following statement is true or false for EJB. 1. EJB exists in the middle-tier 2. EJB specifies an execution environment 3. EJB supports transaction processing A) 1-true, 2. true, 3. true B) 1- ... false, 3. true C) 1- false, 2- false, 3- false D) 1-true, 2-true, 3-false

Last Answer : A) 1-true, 2. true, 3. true

Some of the situations where inline expansion may not work are: A) For functions returning values, if a loop, a switch or goto exists. B) If functions contain static variables and they are re-cursive. C) For functions not returning values, if return statement exist. D) All of the above.

Description : Some of the situations where inline expansion may not work are: A) For functions returning values, if a loop, a switch or goto exists. B) If functions contain static variables and they are re-cursive. C) For functions not returning values, if return statement exist. D) All of the above.

Last Answer : D) All of the above.

What is the output of the following code? a={1:"A",2:"B",3:"C"} print(a.setdefault(3)) a) {1: ‘A’, 2: ‘B’, 3: ‘C’} b) C c) {1: 3, 2: 3, 3: 3} d) No method called setdefault() exists for dictionary

Description : What is the output of the following code? a={1:"A",2:"B",3:"C"} print(a.setdefault(3)) a) {1: ‘A’, 2: ‘B’, 3: ‘C’} b) C c) {1: 3, 2: 3, 3: 3} d) No method called setdefault() exists for dictionary

Last Answer : b) C

For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Description : For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Last Answer : (D) |w|3

Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student e where e course='5' and e marks ≥ s marks) Q.2. Select S.stuid From student S Where s.marks > any (select distinct marks from student S where s.couse = 5) (A) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Description : Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student ... ) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Last Answer : (B) Q.2 Explanation: First query gives stuid of students whose marks are greater than all students taking course 5. Second query gives stuid of students whose marks are greater than any student taking ... comparison is between maximum of marks by any student in course 5. So the answer is option D.

Given the following statements: S1: Every context-sensitive language L is recursive. S2: There exists a recursive language that is not context sensitive. Which statement is correct? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements: S1: Every context-sensitive language L is recursive. S2: There exists a recursive language that is not context sensitive. Which statement is correct? (A) S1 is not correct and S2 is ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (D) S1 is correct and S2 is correct. 

Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Description : Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows: (1) pk(R2)→pk(R1) (2) pk(R1)→pk(R2) (3) pk(R2)→R1∩R2 (4) pk(R1)→R1∩R2

Last Answer : Answer: 2

Speed breaker has to be provided on road approaches of level crossing at maximum feasible distance within Railway boundary but not exceeding a) 10 meters b) 15 meters c) 20 meters* d) 200 meters

Description : Speed breaker has to be provided on road approaches of level crossing at maximum feasible distance within Railway boundary but not exceeding a) 10 meters b) 15 meters c) 20 meters* d) 200 meters

Last Answer : c) 20 meters*

What is the molecular geometry of thiocyanate (pron: thie-owe-SIE-a-nate) ion (SCN minus 1)? w) linear x) angular y) tetrahedral z) pyramidal

Description : What is the molecular geometry of thiocyanate (pron: thie-owe-SIE-a-nate) ion (SCN minus 1)? w) linear x) angular y) tetrahedral z) pyramidal

Last Answer : ANSWER: W -- LINEAR

What is the molecular geometry of the Bromine Tetraflouride ion (B-F-4-minus 1) w) linear x) angular y) tetrahedral z) pyramidal

Description : What is the molecular geometry of the Bromine Tetraflouride ion (B-F-4-minus 1) w) linear x) angular y) tetrahedral z) pyramidal

Last Answer : ANSWER: Y -- TETRAHEDRAL

What is the molecular geometry of XeO2 (Xenon Dioxide)? w) linear x) angular y) tetrahedral z) trigonal planar

Description : What is the molecular geometry of XeO2 (Xenon Dioxide)? w) linear x) angular y) tetrahedral z) trigonal planar

Last Answer : ANSWER: X -- ANGULAR 

The concavity on the medial side of kidney is known as

Description : The concavity on the medial side of kidney is known as

Last Answer : The concavity on the medial side of kidney is known as A. Renal pelvis B. Hilum C. Calyces D. Pyramid

it is a device to remove soil that tends to stick to the working surface of a disc a) Disc c) Scraper b) Concavity. d) Til

Description : it is a device to remove soil that tends to stick to the working surface of a disc a) Disc c) Scraper b) Concavity. d) Til

Last Answer : Scraper

Why is it difficult to use matrices on deciduous teeth, A. It hurts the kids’ parents B. The small mouth opening of kids in that age range makes it difficult to keep matrices in mouth. C. The occlusal concavity of deciduous teeth

Description : Why is it difficult to use matrices on deciduous teeth, A. It hurts the kids’ parents B. The small mouth opening of kids in that age range makes it difficult to keep matrices in mouth. C. The occlusal concavity of deciduous teeth

Last Answer : . The occlusal concavity of deciduous teeth