True/False Linear Programming 2023 questions with answers
True/False Linear ProgrammingAn LP can have exactly two optimal solutions False; can only have either exactly one or many If the feasible region of any LP is unbounded then the feasible region is not convex False - can still be convex If a CPF has no adjacent CPFs that are better (by the z-value), then there are no better CPFs anywhere True When using the Big M method, if an artificial variable is a basic variable at the optimal solution then the LP is unbounded True - can EITHER be unbounded or no feasible solutions If a Primal LP is unbounded, then the Dual is infeasible True If the Dual LP is unbounded, then the Primal is also unbounded False - the Primal is infeasible if Dual is unbounded
Written for
- Institution
- Cpfs
- Module
- Cpfs
Document information
- Uploaded on
- September 12, 2023
- Number of pages
- 2
- Written in
- 2023/2024
- Type
- Exam (elaborations)
- Contains
- Questions & answers
Subjects
-
truefalse linear programming
-
an lp can have exactly two optimal solutions
-
if the feasible region of any lp is unbounded then
Also available in package deal