Use DNFP 1. The computer solution of the linear programming model corresponding
ID: 3778718 • Letter: U
Question
Use DNFP 1. The computer solution of the linear programming model corresponding to DNFP 2 would show
at least one surplus variable will be nonzero in the computer solution
infeasibility
at least one slack variable will be nonzero in the computer solution
multiple optimal solutions
at least one surplus variable will be nonzero in the computer solution
infeasibility
at least one slack variable will be nonzero in the computer solution
multiple optimal solutions
none of the above
90 1 7 10 50 2 80 3 60 4 90 90 A 120 B 100 C 110Explanation / Answer
it will not be surplus or slack because it A,B AND C have same number of contraints that is 4 .they are neither less nor more for each one of them.
The answer is infeasible as we cannot conclude all of them will have 3 equations but we don’t know how to solve them.The final solution is unknown as we cannot solve the equations
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.