1969
DOI: 10.1137/0117120
|View full text |Cite
|
Sign up to set email alerts
|

Extensions of Lagrange Multipliers in Nonlinear Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0
1

Year Published

1971
1971
2023
2023

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 90 publications
(29 citation statements)
references
References 9 publications
0
28
0
1
Order By: Relevance
“…Thus, n can be thought of as the maximum number of additional degrees of freedom needed to price the output or the maximum additional dimensions needed for the space where the separating hyperplane or linear support function exists. In R m , the support function is nonconvex and poorly behaved (Gould 1971). In R m+n , there is always a separating hyperplane.…”
Section: Prices In the Lp That Solve The Mipmentioning
confidence: 99%
“…Thus, n can be thought of as the maximum number of additional degrees of freedom needed to price the output or the maximum additional dimensions needed for the space where the separating hyperplane or linear support function exists. In R m , the support function is nonconvex and poorly behaved (Gould 1971). In R m+n , there is always a separating hyperplane.…”
Section: Prices In the Lp That Solve The Mipmentioning
confidence: 99%
“…Cependant, cohérents avec eux-mêmes, 11. Par Arrow, Chenery, Hurwicz, Solow et Uzawa. les économistes se sont confinés au cas convexe et ont laissé aux mathématiciens, notamment à Gould (1969Gould ( , 1972, Rockafellar (1974), Tind et Wolsey (1981), le soin d'apporter les derniers raffinements à un théorie générale de la dualité.…”
Section: Programmation Non Linéaireunclassified
“…According to the results by Huang and Shen [18], and its references such as Shannon [19], Skilling and Gull [20], Everett [21], Brooks and Geoffrion [22], Gould [23] and Greenberg and Pierskalla [24], Problem (5) is equivalent to the following problem: min z s.t.…”
Section: Maximum Entropy Methodsmentioning
confidence: 99%