Linear programming - Simplex method

Linear programming - Simplex method

Postby Guest » Fri Jan 24, 2020 9:26 am

Hello i would like to ask a question about an exercise that i had at my exams at University. Actually it was a linear programming problem and we hat to solve it using the simplex method. However my professor had writen the inequalities of the variables in a way that was a little weird . At the canonical form Instead of having x1,x2..n < or > 0 he had met -x1, -x2 <0. (please find attached an example showing all that).
I would to ask the community if i dit well by solving the problem as :
Si -x1,-x2 <0 --> x1>0, x2>0 and after i contunued by applying the simplex method i know (bigM method with the pivot element etc) .[/color][/url]
https://cbom.atozmath.com/CBOM/Simplex. ... 1#PrevPart


Elena
Attachments
algorithme simplexe forme canonique.PNG
algorithme simplexe forme canonique.PNG (62.21 KiB) Viewed 1589 times
Guest
 

Re: Linear programming - Simplex method

Postby Guest » Mon Nov 02, 2020 4:08 pm

Do you realize that saying "[tex]-x_1\le 0[/tex]" and "[tex]-x_2\le 0[/tex]" is exactly the same as saying "[tex]x_1\ge 0[/tex]" and "[tex]x_2\ge 0[/tex]"?
Guest
 


Return to Simultaneous Equations, Systems of Equations/Inequalities



Who is online

Users browsing this forum: No registered users and 5 guests

cron