The Linear Programming of Scale Retracts

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Standard Commands %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%mathbb

%greek

%GREEK

%cal

%tilde

%bar %

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Math Commands %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%compactified moduli space

% % % % %SYMPLECTIC GEOMETRY % % % % %

% % % % %Hat Delbar % % % % %

% % % % %COLORS % % % % %

% % % % %GROMOV-WITTEN LANGUAGE % % % % %

% % % % %THOM LANGUAGE % % % % %

% % % % %POLYFOLD LANGUAGE % % % % %

In this note, we briefly demonstrate how the theory of linear programming can be extended to the novel infinite-dimensional setting of scale retracts.

1 Infinite-dimensional linear programming

At its core, a linear program is an optimization problem of a linear objective functional and linear constraints. There is nothing to stop

2 The scale retracts of polyfold theory

3 Glued scale retracts

4 The classical theorems

4.1 The duality theorem

4.2 The simplex algorithm

5 References