Linear programming model-unbounded


The solution to the following linear programming model will be

maximize Z = 3x1 + 3x2

Subject to

>8x1 + 6x2 >= 36

5x2 >= 50

2x1 + 4x2 >= 160

x1, x2 >= 0

A Unbounded

B Infeasible

C Multiple optimal

D Degenerative

Request for Solution File

Ask an Expert for Answer!!
Business Management: Linear programming model-unbounded
Reference No:- TGS077093

Expected delivery within 24 Hours