A solution that satisfies all the constraints of a linear programming – McqOptions

MCQOPTIONS

1.	A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called
A.	optimal.
B.	feasible.
C.	infeasible.
D.	semi-feasible.
Answer» D. semi-feasible.

Discussion

No Comment Found

Related MCQs

……. is a series of related activities which result in some product or services.
An activity which must be completed before one or more other activities start is known as……….activity.
An event which represents the beginning of more than one activity is known as ………..event.
….……..is that sequence of activities which determines the total project time.
Alternative solutions exist of an LP model when
One disadvantage of using North-West Corner rule to find initial solution to the transportationproblem is that
The solution space (region) of an LP problem is unbounded due to
While solving a LP model graphically, the area bounded by the constraints is called
During an iteration while moving from one solution to the next, degeneracy may occur when
A simulation model used in situations where the state of the system at one point in time does not affect the state of the system at future points in time is called a