Aspire Faculty ID #19077 · Topic: UGC NET Computer Science Dec 2019 (Paper II) · Just now
UGC NET Computer Science Dec 2019 (Paper II)

Consider the following statements with respect to duality in LPP:

(a) The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself.

(b) If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal solution.

(c) If either problem has an unbounded optimum solution, then the other problem has no feasible solution at all.

Which of the statements is/are correct?

Solution

The final simplex table of the primal problem also gives information about the optimal solution of the dual problem.

Statement (b) is correct.

By strong duality theorem, if one problem has a finite optimal solution, then the other also has a finite optimal solution.

Statement (c) is correct.

If one problem is unbounded, then the other problem is infeasible.

So, all three statements are correct.

Previous 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Nearest first
1
Consider the following statements: $S_1:$ If a group $(G,*)$ is of order $n$, and $a\in G$ is such that $a^m=e$ for som…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
. Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength of fitn…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
The order of schema $?10?101?$ and $???0??1$ are $...............$ and $...............$ respectively.
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
Let $W_{ij}$ represents weight between node $i$ at layer $k$ and node $j$ at layer $(k-1)$ of a given multilayer percep…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
A fuzzy conjunction operator $t(x,y)$ and a fuzzy disjunction operator $s(x,y)$ form a pair if they satisfy: $t(x,y)=1-…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
Consider the following models: $M_1:$ Mamdani model $M_2:$ Takagi-Sugeno-Kang model $M_3:$ Kosko's additive model $($SA…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
Consider the game tree given below.Here $\circ$ and $\square$ represent MIN and MAX nodes respectively. The value of th…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
Consider the following statements: $S_1:\forall xP(x)\vee \forall xQ(x)$ and $\forall x(P(x)\vee Q(x))$ are not logical…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
According to Dempster-Shafer theory for uncertainty management, where $Bel(A)$ denotes belief of event $A$.
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
 The full form of ICANN is:
Topic: UGC NET Computer Science Dec 2019 (Paper II)

Next 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Ascending by ID
1
The Reduced Instruction Set Computer $($RISC$)$ characteristics are:(a) Single cycle instruction execution (b) Variable…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
Which of the following binary codes for decimal digits are self complementing? (a) $8421$ code (b) $2421$ code (c) exce…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
Consider the following statements with respect to approaches to fill areas on raster systems:P: To determine the overla…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
Which of the following statements are true regarding C++? (a) Overloading gives the capability to an existing operator …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
Which of the following are legal statements in C programming language? (a) int *P = &44; (b) int *P = &r; (c) i…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
Two concurrent executing transactions $T_1$ and $T_2$ are allowed to update same stock item say $A$ in an uncontrolled …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
Identify the circumstances under which pre-emptive CPU scheduling is used: (a) A process switches from Running state to…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
The following multithreaded algorithm computes transpose of a matrix in parallel:$p\ Trans(X,Y,N)$if $N=1$then $Y[1,1]\…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
Consider the following statements: (a) The running time of dynamic programming algorithm is always $\theta(\rho)$ where…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
Consider the following statements: (a) Fiber optic cable is much lighter than copper cable. (b) Fiber optic cable is no…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...