Pseudo-Concave Programming and Lagrange Regularity

DOI10.1287/OPRE.15.5.882MaRDI QIDQ5529078zbMATH OpenOpenAlexFDO

Authors

Publication date 1967

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.15.5.882

zbMATH Keywords

operations research

Cited in

(27)

• Some results on pseudolinear quadratic fractional functions
• A new look at fractional programming
• On pseudolinear functions
• Stability theorems for infinitely constrained mathematical programs
• Rates of convergence for a method of centers algorithm
• Condizioni necessarie e sufficienti per un problema di programmazione non lineare
• On characterizing the solution sets of pseudolinear programs
• Generalized affine functions and generalized differentials
• Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
• Invex programming problems with equality and inequality constraints
• First and second order characterizations of pseudolinear functions
• On the pseudolinearity of quadratic fractional functions
• Pseudolinearity and efficiency
• Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
• Stationary Points and Necessary Conditions in Vector Extremum Problems
• Über einige Anwendungen der semiinfiniten Optimierung
• Convergence bounds for nonlinear programming algorithms
• Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients
• Invariant pseudolinearity with applications
• A note on characterization of solution sets to pseudolinear programming problems
• On indefinite programming problems
• On indefinite programming problems
• C-programming and the minimization of pseudolinear and additive concave functions
• Generalized pseudolinearity
• Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints
• Characterizations of locally Lipschitz geodesic pseudolinear functions on Hadamard manifolds
• The convexity of the solution set of a pseudoconvex inequality

This page was built for publication: Pseudo-Concave Programming and Lagrange Regularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5529078)