Question

Remarks: In all the algorithms, always explain precisely your solution or prove if required. You Always Must analyze the running time of any algorithm. The time complexity should be as small as possible. A correct algorithm with large complexity, may not get full credit. Don't write programs for your solutions. Question 1: Consider the following LP Minimize $50 \cdot x + 15 \cdot y$ Subject to: $2x + y \leq 100$ $x + y \leq 80$ $x \geq 0$ $y \geq 0$ 1. Plot the feasible region 2. Find the basic feasible solutions (the corners) 3. Find the optimum

          Remarks: In all the algorithms, always explain precisely your solution or prove if required.
You Always Must analyze the running time of any algorithm. The time complexity should
be as small as possible. A correct algorithm with large complexity, may not get full credit.
Don't write programs for your solutions.
Question 1:
Consider the following LP
Minimize $50 \cdot x + 15 \cdot y$
Subject to:
$2x + y \leq 100$
$x + y \leq 80$
$x \geq 0$
$y \geq 0$
1. Plot the feasible region
2. Find the basic feasible solutions (the corners)
3. Find the optimum

remarks in all the algorithms always explain precisely your solution or prove if required you always must analyze the running time of any algorithm the time complexity should be as small as 43934

Added by Pilar G.

Question

Please give Ace some feedback