Register

UGC NET CSE | December 2012 | Part 3 | Question: 18

• recategorized
4,412 views

1 Answer

Best answer
1 votes
1 votes
Total number of basic solutions are given by the eqn

n!/m! * (n-m)!

where m=3 no of basic variables and n=3+2 =5 total no of variables

hence total soln =5!/3!2!=5x4/2=10

Ans is C
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3.1k
views
1 answers
2 votes
go_editor asked Jul 7, 2016
3,066 views
UGC NET CSE | June 2012 | Part 3 | Question: 46
The feasible region represented by the constraints $x_1 - x_2 \leq 1, x_1 + x_2 \geq 3, x_1 \geq 0, x_2 \geq 0$ of the objective function Max $Z=3x_1 + 2x_2$ isA polygonUnbounded feasible regionA pointNone of these
User Avatar
4.9k
views
2 answers
1 votes
go_editor asked Jul 12, 2016
4,869 views
UGC NET CSE | December 2012 | Part 3 | Question: 28
The initial basic feasible solution to the following transportation problem using Vogel's approximation method is$\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{$ ... $= 180$None of the above
User Avatar
14.2k
views
1 answers
1 votes
go_editor asked Jul 12, 2016
14,154 views
UGC NET CSE | December 2012 | Part 3 | Question: 24
If dual has an unbounded solution, then its corresponding primal hasno feasible solutionunbounded solutionfeasible solutionnone of these
User Avatar
14.8k
views
1 answers
1 votes
go_editor asked Aug 11, 2016
14,828 views
UGC NET CSE | December 2015 | Part 3 | Question: 52
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zerogeneratedegenerateinfeasibleunbounded
User Avatar
Link Copied!