Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Questions  >  Consider the following conditions:(a)The solu... Start Learning for Free
Consider the following conditions:
(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.
(c) All the positive allocations must be in independent positions.
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
Codes:
  • a)
    (a) and (b) only
  • b)
    (a) and (c) only
  • c)
    (b) and (c) only
  • d)
    (a), (b) and (c)
Correct answer is option 'D'. Can you explain this answer?
Most Upvoted Answer
Consider the following conditions:(a)The solution must be feasible, i....
Non-Degenerate Basic Feasible Solution in Transportation Problem

Conditions for a Feasible Solution:
- A feasible solution must satisfy all the supply and demand constraints.

Conditions for Positive Allocations:
- The number of positive allocations must be equal to m*n.
- All the positive allocations must be in independent positions.

Non-Degenerate Basic Feasible Solution:
- A non-degenerate basic feasible solution satisfies all the conditions for a feasible solution and positive allocations.
- In addition, it must also meet the following conditions:
- The number of positive allocations must be equal to m*n and the number of basic variables must be equal to m+n-1.
- The basic variables must be independent, i.e. no two basic variables can come from the same row or column.
- The non-basic variables must be zero.
- Non-degenerate basic feasible solutions are preferred over degenerate basic feasible solutions as they help in finding the optimal solution faster.
Free Test
Community Answer
Consider the following conditions:(a)The solution must be feasible, i....
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.
(c) All the positive allocations must be in independent positions.
So, option (D) is correct.
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer?
Question Description
Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer?.
Solutions for Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer?, a detailed solution for Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer? has been provided alongside types of Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c) All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:a)(a) and (b) onlyb)(a) and (c) onlyc)(b) and (c) onlyd)(a), (b) and (c)Correct answer is option 'D'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Explore Courses
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev