I have the linear program
$$\begin{array}{ll} \text{minimize} & -2x-5y\\ \text{subject to} & 3x + 4y \geq 5\\ & x, y \geq 0\end{array}$$
I can solve it using Simplex algorithm, but I want to find out if there is an easier way to see whether a given linear programming problem has an optimal solution or not.


Write the linear program in maximization standard form
$$\begin{array}{ll} \text{maximize} & 2x_1 + 5 x_2\\ \text{subject to} & -3 x_1 - 4 x_2 \leq -5\\ & x_1, x_2 \geq 0\end{array}$$
The dual of this linear program is the following
$$\begin{array}{ll} \text{minimize} & -5y\\ \text{subject to} & - 3 y \geq 2\\ & - 4 y \geq 5\\ & y \geq 0\end{array}$$
From the two inequality constraints, we have $y \leq -5/4$. However, we also have the nonnegativity constraint $y \geq 0$. Hence, the dual linear program is infeasible and, therefore, the primal is either infeasible or unbounded. If one can find a solution using Simplex, then the primal is unbounded.