A Theorem of Fritz John in Mathematical Programming

Richard W. Cottle

A chapter in Traces and Emergence of Nonlinear Programming, 2014, pp 111-123 from Springer

Abstract: Abstract A typical formulation of the mathematical programming problem is 2.1 $$ \rm {Maximize \;f(x) \;subject \; to \;{x \varepsilon E_{n}, g(x)\geqq 0.}} $$

Keywords: Constraint Qualification; Mathematical Programming Problem; Rand Corporation; Official Opinion; Anniversary Volume (search for similar items in EconPapers)
Date: 2014
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:sprchp:978-3-0348-0439-4_6

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

DOI: 10.1007/978-3-0348-0439-4_6

Access Statistics for this chapter

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