On Minimax Fractional Semi-Infinite Programming Problems with Applications
From MaRDI portal
Publication:5861981
Recommendations
- Characterizations and applications of generalized invexity and monotonicity in Asplund spaces
- Exact penalty and necessary optimality conditions in constrained optimization
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Exact penalty in constrained optimization and the Mordukhovich basic subdifferential
- scientific article; zbMATH DE number 2196501
- Exact penalty property in optimization with mixed constraints via variational analysis
- Exact penalty in constrained optimization and critical points of Lipschitz functions
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Nonsmooth optimization using Mordukhovich's subdifferential
Cites work
- A class of nonsmooth fractional multiobjective optimization problems
- A novel embedded min-max approach for feature selection in nonlinear support vector machine classification
- Duality for a class of minmax and inexact programming problem
- Fractional Programming. I, Duality
- Fractional Programming. II, On Dinkelbach's Algorithm
- Fractional programming
- Fractional programming: Applications and algorithms
- Generalized convexity and fractional programming with economic applications. Proceedings of the international workshop on Generalized concavity, fractional programming and economic applications. Held at the University of Pisa, Italy, May 30 - June 1,
- Minimax programming as a tool for studying robust multi-objective optimization problems
- Multicriteria Optimization
- Nondifferentiable minimax programming problems with applications
- Nonsmooth semi-infinite multiobjective optimization problems
- On Nonlinear Fractional Programming
- Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
- Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
- Representation of the normal cone and its applications in robust minimax programming problems
- Subdifferentials of marginal functions in semi-infinite programming
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints
- Variational analysis and applications
Cited in
(8)- On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- A solvability theorem and minimax fractional programming
- Global algorithm for effectively solving min-max affine fractional programs
- scientific article; zbMATH DE number 96517 (Why is no real title available?)
- Fractional semi-infinite programming problems: optimality conditions and duality via tangential subdifferentials
- Continuous-time fractional minmax programming
- Optimality conditions for nonsmooth minimax fractional optimization problems with an infinite number of constraints
This page was built for publication: On Minimax Fractional Semi-Infinite Programming Problems with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5861981)
