A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of a L.P.P. is called its | QuantalphaAlgorithms

Hide Intro Register

Posts People Badges

linearprogramming operationsresearch OR #LinearProgramming #OperationsResearch

About this forum

A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of a L.P.P. is called its

13 Replies

438 Views

Ave Kaye Soriano

A. Unbounded solution

B. Optimum solution

C. Feasible solution

D. None of these

Christian Dave Canega

Best Answer

C

Jhon Carlo Encio

c

Lhyza Jhanne Evia

c

c

Ave Kaye Soriano

Author

c

Jamela Maglines

c

Mark Lui Manuel

c

c

Duncan Valenzuela

C

Jamie Rose Pacheco

c

C

John Elizar Enrina

C

Chlark Jude Villanueva

C