Convex Transformable Programming Problems and Invexity
From MaRDI portal
Publication:3783085
DOI10.1080/02522667.1987.10698886zbMATH Open0641.90070OpenAlexW2316806501MaRDI QIDQ3783085FDOQ3783085
Bertram Mond, Morgan A. Hanson
Publication date: 1987
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1987.10698886
Recommendations
Cites Work
Cited In (34)
- Hermite-Hadamard-Fejér inequality related to generalized convex functions via fractional integrals
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- Optimality and mixed duality in multiobjective \(E\)-convex programming
- Title not available (Why is that?)
- On slack $2$-geodesic convex set and geodesic $E$-pseudoconvex function with application
- A note on generalized convex bodies in elliptic space
- Vector continuous-time programming without differentiability
- Generalizations of \(E\)-convex and B-vex functions
- A note on invex problems with nonnegative variable
- Pre-invex functions in multiple objective optimization
- Nonlinear programming with \(E\)-preinvex and local \(E\)-preinvex functions
- On some generalized convex functions under differentiability
- New optimality conditions for nonsmooth control problems
- Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces
- Generalization of preinvex and B-vex functions
- Dynamical significance of generalized fractional integral inequalities via convexity
- Subvexormal functions and subvex functions
- Multiobjective fractional programming with generalized convexity
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- Optimality criteria in \(E\)-convex programming
- Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
- Preinvexity in Multiobjective Fractional Programming
- Duality and a characterization of pseudoinvexity for Pareto and weak Pareto solutions in nondifferentiable multiobjective programming
- Multiobjective duality with invexity
- Existence of solutions for vector optimization
- Geodesic \(E\)-invex sets and geodesic \(E\)-preinvex functions on Riemannian manifolds
- Title not available (Why is that?)
- \(r\)-convex transformability in nonlinear programming problems.
- Some inequalities for functions having Orlicz-convexity
- Transformations of variables invariant under minimization of binary functions of multivalued arguments
- Title not available (Why is that?)
- Contragredient transformations applied to the optimal projection equations
- SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY
- Invex programming problems with equality and inequality constraints
This page was built for publication: Convex Transformable Programming Problems and Invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783085)