A basic solution which also satisfies the condition in which all basic variables are non ‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Related MCQs

• A basic solution which also satisfies the condition in which all basic variables are non ‐ negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• All the constraints are expressed as equations and the right hand side of each constraint and all variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• All the constraints are expressed as equations and the right hand side of each constraint and all variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rim requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rim requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐