search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
1 vote
2.5k views

In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are

  1. 6
  2. 8
  3. 10
  4. 12
in Optimization
recategorized
2.5k views

1 Answer

1 vote
 
Best answer
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

1 vote
2 answers
1
2.2k views
The initial basic feasible solution to the following transportation problem using Vogel's approximation method is $D_1$ $D_2$ $D_3$ $D_4$ Supply $S_1$ 1 2 1 4 30 $S_2$ 3 3 2 1 50 $S_3$ 4 2 5 9 20 Demand 20 40 30 10 $\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{$ ... cost = 180 $x_{11}=20, x_{13}=10, x_{22}=20, x_{23}=20, x_{24}=10, x_{32}=10$, Total cost = 180 None of the above
asked Jul 12, 2016 in Optimization jothee 2.2k views
1 vote
1 answer
2
2k views
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zero generate degenerate infeasible unbounded
asked Aug 11, 2016 in Optimization jothee 2k views
2 votes
1 answer
3
1.1k views
Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution S3: If ... the two problems are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
asked Aug 2, 2016 in Optimization jothee 1.1k views
2 votes
1 answer
4
1.2k views
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 - x_2 \leq -3$ $\text{and} \quad x_1 , x_2 \geq 0 $ Feasible solution No feasible solution Unbounded solution Single point as solution
asked Jul 27, 2016 in Optimization jothee 1.2k views
...