|
List of MATLAB Programs for Chapter 11
- find_v.m: Finds a vertex of the feasible region defined by A*x >= b.
- find_vs.m: Finds a vertex of the feasible region defined by A*x = b
with x >= 0.
- lp_ad.m: Simplex algorithm for alternative-form LP problems with degenerate
vertices. Implements Algorithm 11.2 for alternative-form LP problems with
degenerate vertices.
- lp_ad_m.m: Simplex algorithm for alternative-form LP problems with degenerate
vertices that does not require an initial point as input. Implements Algorithm
11.2 for alternative-form LP problems with degenerate vertices that does not require
an initial point as input.
- lp_and.mL: Simplex algorithm for alternative-form LP problems with nondegenerate
vertices. Implements Algorithm 11.1 for alternative-form LP problems with
nondegenerate vertices.
- lp_and_m.m: Simplex algorithm for alternative-form LP problems with nondegenerate
vertices that does not require an initial point as input. Implements Algorithm 11.1
for alternative-form LP problems with nondegenerate vertices that does not require an
initial point as input.
- lp_sd.m: Simplex algorithm for standard-form LP problems with degenerate vertices.
Implements Algorithm 11.3 for standard-form LP problems with degenerate vertices.
- lp_snd.m: Simplex algorithm for standard-form LP problems with nondegenerate vertices.
Implements Algorithm 11.3 for standard-form LP problems with nondegenerate vertices.
|