Does the Following Linear Programming Problem Exhibit Infeasibility, Unboundedness, or Alternate

question 63

Essay

Does the following linear programming problem exhibit infeasibility, unboundedness, or alternate optimal solutions? Explain.
Min
1X + 1Y
s.t.
5X + 3Y ≤ 30
3X + 4Y ≥ 36
Y ≤ 7
X , Y ≥ 0

---

Definitions:

Expression

Any mathematical phrase that can contain numbers, variables, and operation symbols, but does not have an equality symbol.

Simplify

The act of making an expression as simple as possible.

Expression

A combination of symbols that jointly express a quantity or number, which can include variables, constants, and operating symbols.

Simplify

The process of making a mathematical expression as simple as possible by performing all operations and reducing to the fewest terms.