Convex Separable Programming
As it was pointed out in Chapter Two, if f j (x j ) are strictly convex and g ij (x j ) are convex for i= 1,..., m and j ∉ L, the standard simplex method, discarding the restricted basis entry rule, is applicable to the approximating linear program (LASP) (2.17) – (2.21).
KeywordsObjective Function Grid Point Feasible Solution Convex Function Separable Problem
Unable to display preview. Download preview PDF.