1
$\begingroup$

Can we apply simplex method if one or more equation are equal to zero. tell me full criteria my question example is as follows:

Maximize: $z=135x+50y$, subject to:

$$\begin{align} 2x+\frac{1}{2}y&=32 \\ 4x-y&=0 \\ 4x+y&=64 \\ \end{align}$$

Tell me its full criteria to solve it I want to confirm it now .

  • 0
    please reply me i am new in this web and have no good knowledge of linear programming2012-08-01
  • 0
    In the most general formulation, simplex methods deals with both equality and inequality constraints. In your case, where all constraints are equalities, you may be better off simplifying by Gaussian Elimination instead.2012-08-01
  • 1
    Also note that your first and last constraints are equivalent (multiply the first by 2 to get the last).2012-08-01
  • 0
    you can try linear programming method,sketch graph of each constraints,find intersection area and take boundary vertexes2012-08-01
  • 0
    maximum is at point $16$ and $64$ and it is equal to $5360$2012-08-01
  • 0
    sure if instead of $z$ you post some concrete value,it would change2012-08-01

0 Answers 0