Nonlinear Programming $$\sum _i\sum _j c_{ij}x_ix_j, \ \forall \ (i,j)$$ ∑ i ∑ j c ij x i x j, ∀ ( i, j )

J. MacGregor Smith ()
Additional contact information
J. MacGregor Smith: University of Massachusetts

Chapter Chapter 5 in Combinatorial, Linear, Integer and Nonlinear Optimization Apps, 2021, pp 179-230 from Springer

Abstract: Abstract overview Nonlinear Programming (NLP) problems represent some of the most complex optimization problems. Especially when contrasted with LP problems which have dominated the literature in Operations Research. This is because some of the nice properties such as monotonicity and convexity in Linear Programming are not always possible with NLP problems, so many local optimal solutions will exist, not just a single global optimization one. Figure 5.1 illustrates an example problem and the usual local vs. global phenomenon.

Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-75801-1_5

Ordering information: This item can be ordered from
http://www.springer.com/9783030758011

DOI: 10.1007/978-3-030-75801-1_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().