Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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 .

share|cite|improve this question
please reply me i am new in this web and have no good knowledge of linear programming – Rania Umair Aug 1 '12 at 14:00
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. – gt6989b Aug 1 '12 at 14:31
Also note that your first and last constraints are equivalent (multiply the first by 2 to get the last). – Shaktal Aug 1 '12 at 14:32
you can try linear programming method,sketch graph of each constraints,find intersection area and take boundary vertexes – dato datuashvili Aug 1 '12 at 14:39
maximum is at point $16$ and $64$ and it is equal to $5360$ – dato datuashvili Aug 1 '12 at 14:58

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.