Threaded Mode | Linear Mode

Gil · (This post was last modified: 02-06-2023 02:54 PM by Gil.)

Yes, my "..." is character number 30.

I use it also quite a lot in my verbal explanations as in Simplex
when saying, for instance from "a1, a2..., an", instead of repeated character "single dot".
It enables to show more characters in a line.

With your program, it's now easy to replace the bold characters to avoid the three rectangles relative to 19 CHR 1 CHR 19 CHR.

I use also a lot the small square (larger than a do), character number 14, to start different paragraphs in my explanations inside a program.

The same applies to "right triangle/large right arrow", character 134, relative to paragraphs in verbal explanation inside a program.

That is easy to change, for instance replace it by a minus sign with SRPL, so that INOUT could make it the appropriate conversion.

But a lot of work when the outlook of the original version, with character 14, is the want to keep in the program.

Perhaps I should just use your program to replace the bold characters by and, after execution, replace at the end "" by an empty string "".

Example, without INOUT,
for prog —>GO of Directory program SIMPLEX,
at line 12 starting with « (line 4 of the Matrix).

{ "« \"1 Arg:
MATRIX [m+1 × n+2]

m Row (In)Equalities
n Var xi (0/<0/Free)
& Z-Max/Min obj.funct
at last Row m+1:

[[1 0 0 0 0 'F' 0]
[0 1 0 0 0 'F' 0]
[0 1 0 0 0 'L' 9]
[]
[0 0 0 1 0 'E' 6]
[]
[Al1 Aln 'E' Cl]
[Am1 Amn 'G' Cm]
[ z1 zn C 0]]

Letters F L E G
(& possible number C):
in Matrix Col n+1

'F' Free var xi0, <0
'L' Less
'E' Equal =
'G' Greater

Numbers Ci (Cl,Cm)
are free: 0 or 0
& in Col n+2

Input example
& explanations:

[[1 0 0 0 0 0 'F' 0]
Free var x1:-<x1<
Sign of xi unknown:
x1 may be 0 or 0

[0 1 0 0 0 0 'F' 0]
[0 1 0 0 0 0 'L' 9]
'x2 is Free but (L)9'
2 rows for -<x29!

[0 0 1 0 0 0 'L' 8]
var x3: 0! x3 8
& not -! x3 8,
as by rule/default
x3 (xi) alw. 0;
for - x3 8
see above with F

[0 0 0 1 0 0 'E' 6]
var x4 = 6

[0 0 0 0 1 0 'L' 0]
var x5:-< x5 0

[0 0 0 0 0 1 'L'-8]
var x6:-< x6 -8

[0 0 0 0 0 0 1 'G'-9]
var x7: -9 x7<
& not: -9 x70!

Contrarily to:
[0 0 0 0 0 0 1 'L' 9]
var x7: 0! x7 < 9
& not: -! x7 < 9
for - x7 9
see above with F

[]

[Ak1 Ako 'L' Ck]
-< row k Ck

[Al1Aln 'E' Cl]
row l = Cl

[Am1Amn 'G' Cm]
Cm row m<

[ z1 zn C 0 ]]
or [ z1 zn C 'Max']]
or [ z1 zn C 'Min']]
for Z=z1x1+znxn+C
Z-row in last row
C(often 0) of Z in
Col n+1 (not n+2!)
0 'Max' or 'Min':
not important
but in Col n+2

Rows order of the
(In)Equalit. is free

Only Z-coef must alw.
be in last MatRow m+1

At 1st question
further, reply:
1 for MAX
or 0 for MIN
& press ENTER

For the other 5 less
important questions:

General sol (slow)1
* Only SIMPLEX sol 0
Lin comb:all xi0 1
Lin comb:allow x<00
Auto/direct exec 1
Step-by-step 0
Fractions/exact 1
* Fast (no fract.) 0
Full steps saved 1
* If lack of memory 0

choose 1/0 & ENTER
(1 is default sett.)

0 to above * Quest.
to speed up ( less
details & no fract.)

Save all your
Matrixes in DATA Dir
(last menu page)

If lack of memory:

choose option 0
for * above

Still lack of memory

delete some MATrix
in DATA Dir
delete this huge
string & following
DROP command
delete NOTE & VERS

Review data/results
after output?

Press (at 1st Page)

INPUT.last
SOL (details)
S.1N (all vectors)

S.LIN (exact solut)

d.LIN (partial sol)

Press (at 2nd Page)

SLACK.ß (transform)
RESULT¦Ci.rows OK?
STEPS (details)

About program
Max: OK
Min: should be OK
\" DROP 'INPUT.last' STO 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 { } DUP 0 0 0 0 0 RCLF 0 0 0 0 0 0 { } 0 1 0 0 0 0 { } DUP Rnd STACK.full Auto MiMa.s m l.xi l.xi.s time m0 m00 minCi Zrow I J VECTßi step0 STEPS.xß l.check INP.cut Ci.sol I.INP F.l2 Jor l.xi.or fraction INPUTmod SOL fg SOL1 jj SLACK1.ß STEPS1 RESULT1.ROW xab row.prob.l Z xr1 table Ci ineq INPUTmod.OR xsF F.l
« OPTION TICKS 'time' STO -100 CF RAD GO.NEXT
»
»"

[b]Original program
With only INOUT and your program

"« \"1 Arg:
MATRIX [m+1 × n+2]

m Row (In)Equalities
n Var xi (0/<0/Free)
& Z-Max/Min obj.funct
at last Row m+1:

[[1 0 0 0 0 'F' 0]
[0 1 0 0 0 'F' 0]
[0 1 0 0 0 'L' 9]
[]
[0 0 0 1 0 'E' 6]
[]
[Al1 Aln 'E' Cl]
[Am1 Amn 'G' Cm]
[ z1 zn C 0]]

Letters F L E G
(& possible number C):
in Matrix Col n+1

'F' Free var xi0, <0
'L' Less
'E' Equal =
'G' Greater

Numbers Ci (Cl,Cm)
are free: 0 or 0
& in Col n+2

Input example
& explanations:

[[1 0 0 0 0 0 'F' 0]
Free var x1:-<x1<
Sign of xi unknown:
x1 may be 0 or 0

[0 1 0 0 0 0 'F' 0]
[0 1 0 0 0 0 'L' 9]
'x2 is Free but (L)9'
2 rows for -<x29!

[0 0 1 0 0 0 'L' 8]
var x3: 0! x3 8
 & not -! x3 8,
as by rule/default
x3 (xi) alw. 0;
 for - x3 8
see above with F

 [0 0 0 1 0 0 'E' 6]
 var x4 = 6

 [0 0 0 0 1 0 'L' 0]
var x5:-< x5 0

 [0 0 0 0 0 1 'L'-8]
var x6:-< x6 -8

[0 0 0 0 0 0 1 'G'-9]
 var x7: -9 x7<
& not: -9 x70!

 Contrarily to:
[0 0 0 0 0 0 1 'L' 9]
var x7: 0! x7 < 9
& not: -! x7 < 9
 for - x7 9
see above with F

[]

[Ak1 Ako 'L' Ck]
-< row k Ck

[Al1Aln 'E' Cl]
 row l = Cl

 [Am1Amn 'G' Cm]
Cm row m<

[ z1 zn C 0 ]]
or [ z1 zn C 'Max']]
or [ z1 zn C 'Min']]
 for Z=z1x1+znxn+C
Z-row in last row
 C(often 0) of Z in
Col n+1 (not n+2!)
0 'Max' or 'Min':
not important
but in Col n+2

Rows order of the
(In)Equalit. is free

Only Z-coef must alw.
be in last MatRow m+1

At 1st question
further, reply:
1 for MAX
or 0 for MIN
& press ENTER 

For the other 5 less
important questions:

General sol (slow)1
* Only SIMPLEX sol 0
Lin comb:all xi0 1
Lin comb:allow x<00
Auto/direct exec 1
Step-by-step 0
Fractions/exact 1
* Fast (no fract.) 0
Full steps saved 1
* If lack of memory 0

choose 1/0 & ENTER
(1 is default sett.)

0 to above * Quest.
to speed up ( less
details & no fract.)

 Save all your
Matrixes in DATA Dir
(last menu page)

If lack of memory:

choose option 0
for * above

Still lack of memory

delete some MATrix
in DATA Dir
 delete this huge
string & following
DROP command
delete NOTE & VERS

Review data/results
after output?

Press (at 1st Page)

INPUT.last
SOL (details)
S.1N (all vectors)

S.LIN (exact solut)

d.LIN (partial sol)

Press (at 2nd Page)

SLACK.ß (transform)
RESULT¦Ci.rows OK?
STEPS (details)

 About program
Max: OK
Min: should be OK
\" DROP 'INPUT.last' STO 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 { } DUP 0 0 0 0 0 RCLF 0 0 0 0 0 0 { } 0 1 0 0 0 0 { } DUP Rnd STACK.full Auto MiMa.s m l.xi l.xi.s time m0 m00 minCi Zrow I J VECTßi step0 STEPS.xß l.check INP.cut Ci.sol I.INP F.l2 Jor l.xi.or fraction INPUTmod SOL fg SOL1 jj SLACK1.ß STEPS1 RESULT1.ROW xab row.prob.l Z xr1 table Ci ineq INPUTmod.OR xsF F.l
« OPTION TICKS 'time' STO -100 CF RAD GO.NEXT
»
»"

And, at the end, deleting the "“
"« \"1 Arg:
MATRIX [m+1 × n+2]

m Row (In)Equalities
n Var xi (0/<0/Free)
& Z-Max/Min obj.funct
at last Row m+1:

[[1 0 0 0 0 'F' 0]
[0 1 0 0 0 'F' 0]
[0 1 0 0 0 'L' 9]
[]
[0 0 0 1 0 'E' 6]
[]
[Al1 Aln 'E' Cl]
[Am1 Amn 'G' Cm]
[ z1 zn C 0]]

Letters F L E G
(& possible number C):
in Matrix Col n+1

'F' Free var xi0, <0
'L' Less
'E' Equal =
'G' Greater

Numbers Ci (Cl,Cm)
are free: 0 or 0
& in Col n+2

Input example
& explanations:

[[1 0 0 0 0 0 'F' 0]
Free var x1:-<x1<
Sign of xi unknown:
x1 may be 0 or 0

[0 1 0 0 0 0 'F' 0]
[0 1 0 0 0 0 'L' 9]
'x2 is Free but (L)9'
2 rows for -<x29!

[0 0 1 0 0 0 'L' 8]
var x3: 0! x3 8
 & not -! x3 8,
as by rule/default
x3 (xi) alw. 0;
 for - x3 8
see above with F

[0 0 0 1 0 0 'E' 6]
 var x4 = 6

 [0 0 0 0 1 0 'L' 0]
var x5:-< x5 0

[0 0 0 0 0 1 'L'-8]
var x6:-< x6 -8

[0 0 0 0 0 0 1 'G'-9]
 var x7: -9 x7<
& not: -9 x70!

Contrarily to:
[0 0 0 0 0 0 1 'L' 9]
var x7: 0! x7 < 9
& not: -! x7 < 9
 for - x7 9
see above with F

[]

[Ak1 Ako 'L' Ck]
-< row k Ck

[Al1Aln 'E' Cl]
 row l = Cl

 [Am1Amn 'G' Cm]
Cm row m<

[ z1 zn C 0 ]]
or [ z1 zn C 'Max']]
or [ z1 zn C 'Min']]
 for Z=z1x1+znxn+C
Z-row in last row
C(often 0) of Z in
Col n+1 (not n+2!)
0 'Max' or 'Min':
not important
but in Col n+2

Rows order of the
(In)Equalit. is free

Only Z-coef must alw.
be in last MatRow m+1

At 1st question
further, reply:
1 for MAX
or 0 for MIN
& press ENTER

For the other 5 less
important questions:

General sol (slow)1
* Only SIMPLEX sol 0
Lin comb:all xi0 1
Lin comb:allow x<00
Auto/direct exec 1
Step-by-step 0
Fractions/exact 1
* Fast (no fract.) 0
Full steps saved 1
* If lack of memory 0

choose 1/0 & ENTER
(1 is default sett.)

0 to above * Quest.
to speed up ( less
details & no fract.)

Save all your
Matrixes in DATA Dir
(last menu page)

If lack of memory:

choose option 0
for * above

Still lack of memory

delete some MATrix
in DATA Dir
delete this huge
string & following
DROP command
delete NOTE & VERS

Review data/results
after output?

Press (at 1st Page)

INPUT.last
SOL (details)
S.1N (all vectors)

S.LIN (exact solut)

d.LIN (partial sol)

Press (at 2nd Page)

SLACK.ß (transform)
RESULT¦Ci.rows OK?
STEPS (details)

About program
Max: OK
Min: should be OK
\" DROP 'INPUT.last' STO 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 { } DUP 0 0 0 0 0 RCLF 0 0 0 0 0 0 { } 0 1 0 0 0 0 { } DUP Rnd STACK.full Auto MiMa.s m l.xi l.xi.s time m0 m00 minCi Zrow I J VECTßi step0 STEPS.xß l.check INP.cut Ci.sol I.INP F.l2 Jor l.xi.or fraction INPUTmod SOL fg SOL1 jj SLACK1.ß STEPS1 RESULT1.ROW xab row.prob.l Z xr1 table Ci ineq INPUTmod.OR xsF F.l
« OPTION TICKS 'time' STO -100 CF RAD GO.NEXT
»
»" "\\<< \"1 Arg:
MATRIX [m+1 \\.x n+2]

m Row (In)Equalities
n Var xi (\\>=0/<0/Free)
& Z-Max/Min obj.funct
at last Row m+1:

[[1 0 0 0 0 'F' 0]
[0 1 0 0 0 'F' 0]
[0 1 0 0 0 'L' 9]
[]
[0 0 0 1 0 'E' 6]
[]
[Al1 Aln 'E' Cl]
[Am1 Amn 'G' Cm]
[ z1 zn C 0]]

\\|> Letters F L E G
(& possible number C):
in Matrix Col n+1

'F' Free var xi\\>=0, <0
'L' Less \\-> \\<=
'E' Equal \\-> =
'G' Greater \\-> \\>=

\\|> Numbers Ci (Cl,Cm)
\\[] are free: \\>=0 or \\<=0
\\[] & in Col n+2

\\|> Input example
& explanations:

[[1 0 0 0 0 0 'F' 0]
Free var x1:-\\oo<x1<\\oo
Sign of xi unknown:
x1 may be \\>=0 or \\<=0

[0 1 0 0 0 0 'F' 0]
[0 1 0 0 0 0 'L' 9]
'x2 is Free but \\<=(L)9'
\\->2 rows for -\\oo<x2\\<=9!

[0 0 1 0 0 0 'L' 8]
var x3: 0!\\<= x3 \\<= 8
 & not -\\oo!\\<= x3 \\<= 8,
as by rule/default
x3 (xi) alw. \\>= 0;
 for -\\oo \\<= x3 \\<= 8
see above with F

[0 0 0 1 0 0 'E' 6]
 var x4 = 6

 [0 0 0 0 1 0 'L' 0]
var x5:-\\oo< x5 \\<= 0

[0 0 0 0 0 1 'L'-8]
var x6:-\\oo< x6 \\<= -8

[0 0 0 0 0 0 1 'G'-9]
 var x7: -9 \\<=x7<\\oo
& not: -9 \\<=x7\\<=0!

Contrarily to:
[0 0 0 0 0 0 1 'L' 9]
var x7: 0! \\<= x7 < 9
& not: -\\oo! \\<= x7 < 9
 for -\\oo \\<= x7 \\<= 9
see above with F

[]

[Ak1 Ako 'L' Ck]
-\\oo< row k \\<= Ck

[Al1Aln 'E' Cl]
 row l = Cl

 [Am1Amn 'G' Cm]
Cm \\<= row m<\\oo

[ z1 zn C 0 ]]
or [ z1 zn C 'Max']]
or [ z1 zn C 'Min']]
 for Z=z1x1+znxn+C
\\[] Z-row in last row
\\[] C(often 0) of Z in
Col n+1 (not n+2!)
\\[] 0 'Max' or 'Min':
not important
but in Col n+2

\\|>Rows order of the
(In)Equalit. is free

\\|>Only Z-coef must alw.
be in last MatRow m+1

\\|>At 1st question
further, reply:
1 for MAX
or 0 for MIN
& press ENTER

\\|> For the other 5 less
important questions:

\\[]General sol (slow)\\->1
* Only SIMPLEX sol \\->0
\\[]Lin comb:all xi\\>=0 \\->1
Lin comb:allow x<0\\->0
\\[]Auto/direct exec \\->1
Step-by-step \\->0
\\[]Fractions/exact \\->1
* Fast (no fract.) \\->0
\\[]Full steps saved \\->1
* If lack of memory \\->0

choose 1/0 & ENTER
(1 is default sett.)

0 to above * Quest.
to speed up (\\-> less
details & no fract.)

\\|> Save all your
Matrixes in DATA Dir
(last menu page)

\\|> If lack of memory:

choose option 0
for * above

\\|> Still lack of memory

delete some MATrix
in DATA Dir
\\[] delete this huge
string & following
DROP command
\\[] delete NOTE & VERS

\\|> Review data/results
after output?

\\->Press (at 1st Page)

\\[]INPUT.last
\\[]SOL (details)
\\[]S.1\\173N (all vectors)

S.LIN (exact solut)

d.LIN (partial sol)

\\->Press (at 2nd Page)

\\[]SLACK.\\Gb (transform)
\\[]RESULT\\166Ci.rows OK?
\\[]STEPS (details)

\\|> About program
Max: OK
Min: should be OK
\" DROP 'INPUT.last' STO 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 { } DUP 0 0 0 0 0 RCLF 0 0 0 0 0 0 { } 0 1 0 0 0 0 { } DUP \\-> \\<-Rnd \\<-STACK.full \\<-Auto \\<-MiMa.s \\<-m \\<-l.xi \\<-l.xi.s \\<-time \\<-m0 \\<-m00 \\<-minCi \\<-Zrow \\<-I \\<-J \\<-VECT\\Gbi \\<-step0 \\<-STEPS.x\\Gb \\<-l.check \\<-INP.cut \\<-Ci.sol \\<-I.INP \\<-F.l2 \\<-Jor \\<-l.xi.or \\<-fraction \\<-INPUTmod \\<-\\ooSOL \\<-fg \\<-SOL1 \\<-jj \\<-SLACK1.\\Gb \\<-STEPS1 \\<-RESULT1.ROW \\<-xab \\<-row.prob.l \\<-Z \\<-xr1 \\<-table \\<-Ci \\<-ineq \\<-INPUTmod.OR \\<-xsF \\<-F.l
\\<< OPTION TICKS '\\<-time' STO -100 CF RAD GO.NEXT
\\>>
\\>>"

readable than my initial, original version.