Register

UGC NET CSE | December 2013 | Part 3 | Question: 1

• recategorized by
2,383 views

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2.5k
views
1 answers
2 votes
go_editor asked Jul 27, 2016
2,543 views
UGC NET CSE | December 2013 | Part 3 | Question: 3
The following Linear Programming problem has:$\text{Max} \quad Z=x_1+x_2$Subject to $\quad x_1-x_2 \geq 0$\quad \quad \quad 3x_1 - ... Feasible solutionNo feasible solutionUnbounded solutionSingle point as solution
User Avatar
934
views
1 answers
2 votes
go_editor asked Jul 27, 2016
934 views
UGC NET CSE | December 2013 | Part 3 | Question: 2
Given the problem to maximize $f(x), X=(x_1, x_2, \dots , x_n)$ subject to m number of in equality constraints. $g_i(x) \leq b_i$, i=1, 2, .... m including the non- ... i=1,2 \dots m$g_i (\bar{X}) \leq b_i, i=1,2 \dots m$All of these
User Avatar
5.7k
views
1 answers
3 votes
go_editor asked Aug 11, 2016
5,717 views
UGC NET CSE | December 2015 | Part 3 | Question: 54
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$1450$1465$1480$1520$
User Avatar
2.9k
views
1 answers
2 votes
go_editor asked Aug 11, 2016
2,883 views
UGC NET CSE | December 2015 | Part 3 | Question: 53
Consider the following conditions:The solution must be feasible, i.e. it must satisfy all the supply and demand constraintsThe number of positive allocations must be equal to $m+n-1$ ... and $iii$ only$ii$ and $iii$ only$i$, $ii$ and $iii$
User Avatar
Link Copied!