recategorized
4,230 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
Answer:

Related questions

2 votes
2 votes
1 answer
1
go_editor asked Jul 7, 2016
2,934 views
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 polygonU...
1 votes
1 votes
2 answers
2
go_editor asked Jul 12, 2016
4,693 views
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{...
1 votes
1 votes
1 answer
3
go_editor asked Jul 12, 2016
13,533 views
If dual has an unbounded solution, then its corresponding primal hasno feasible solutionunbounded solutionfeasible solutionnone of these
1 votes
1 votes
1 answer
4
go_editor asked Aug 11, 2016
14,491 views
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zerogeneratedegenerateinfeasibleunbounded