Convex Separable Programming

  • Stefan M. Stefanov
Part of the Applied Optimization book series (APOP, volume 53)

Abstract

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).

Keywords

Objective Function Grid Point Feasible Solution Convex Function Separable Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Stefan M. Stefanov
    • 1
  1. 1.Department of MathematicsSouth West UniversityBlagoevgradBulgaria

Personalised recommendations