Читать книгу Linear and Convex Optimization - Michael H. Veatch - Страница 24

We have not stated the nonnegativity constraints separately. However, a nonnegativity constraint can be included in the functional constraints if needed.

The ability to solve a nonlinear program depends on the type of objective function and constraints . A class of more easily solved nonlinear programs called convex programs is discussed in Chapters 14 and 15. Also, Chapter 3 shows how certain piece‐wise linear convex programs can be converted into linear programs, which is useful because convex programs are somewhat harder to solve than linear programs.