The optimality conditions for approximate solutions of quasiconvex programming problems
From MaRDI portal
Publication:5209919
Recommendations
- The optimality conditions of approximate solutions for quasiconvex multiobjective optimization problem
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Quasi-convex functions and applications to optimality conditions in nonlinear programming
- Optimality Conditions for Quasiconvex Programs
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
Cited in
(11)- Approximate optimality conditions for minimax programming problems
- The optimality conditions of approximate solutions for quasiconvex multiobjective optimization problem
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Optimality via generalized approximate convexity and quasiefficiency
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- scientific article; zbMATH DE number 6474937 (Why is no real title available?)
- Approximate optimality conditions and mixed type duality for quasiconvex optimization problems
- scientific article; zbMATH DE number 7289939 (Why is no real title available?)
- On sufficient optimality conditions for a quasiconvex programming problem
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
This page was built for publication: The optimality conditions for approximate solutions of quasiconvex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5209919)
