Simplex method in prime how to use the constrains maximise s.t. constraints.

[ftneek]

(11-16-2023 08:49 PM)Gil Wrote:  How long does it take to solve
This simplex system?
.
.
.
And the following special system

{
[[ 1 -1 1 -1 0 'E' 2 ]
[ 2 -2 -1 0 1 'E' 0 ]
[ 1 -1 3 0 0 0 'Min' ]]
{ Var†5¦Steps†10 Time†4¦s :

{ "[[ 1 -1 1 -1 0 'E' 2 ]
[ 2 -2 -1 0 1 'E' 0 ]
[ 1 -1 3 0 0 0 'Min' ]]" "{ Var\\|>5\\166Steps\\|>10 Time\\|>4\\166s :

I tested your 3rd system using my simplex program, on my virtual calculator it was solved instantly. Problem 3 has solution 14/3 at x1=2/3,x2=0,x3=4/3,x4=0,x5=0. If you want to time how long it takes for you, you can try the commands yourself. You can time it by wrapping the command with time(). Also some of your text seems to have corrupted, there are floating boxes everywhere.

problem 3:
> simplex2([[1,-1,1,-1,0,1,0,2],[2,-2,-1,0,1,0,1,0],[1,-1,3,0,0,0,0,0],[0,0,0,0,0,1,1,0]],{6,7},7,2,0)