A note on characterization of solution sets to pseudolinear programming problems

DOI10.1080/00036811.2011.584184zbMATH Open1274.90392OpenAlexW2159544994WikidataQ58254104 ScholiaQ58254104MaRDI QIDQ4650237FDOQ4650237

Authors: Marek J. Śmietański 

Publication date: 27 November 2012

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036811.2011.584184

zbMATH Keywords

nonlinear programmingsolution setsgeneralized pseudolinearity

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Vector variational inequality and vector pseudolinear optimization
• Pseudolinearity and efficiency
• A simple characterization of solutions sets of convex programs
• On characterizing the solution sets of pseudolinear programs
• Characterization of solution sets of quasiconvex programs
• An extension of pseudolinear functions and variational inequality problems
• Characterization of solution sets of convex programs
• On pseudolinear functions
• First and second order characterizations of pseudolinear functions
• Pseudo-Concave Programming and Lagrange Regularity
• Dini derivatives in optimization — Part III
• Generalized convexity in nondifferentiable programming
• Characterization of nonsmooth functions through their generalized gradients
• Pseudolinear Programming

Cited In (3)

• Title not available (Why is that?)
• Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
• Characterizations of solution sets of differentiable quasiconvex programming problems

This page was built for publication: A note on characterization of solution sets to pseudolinear programming problems

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