A solvability theorem and minimax fractional programming
From MaRDI portal
Publication:4031966
Recommendations
- On Minimax Fractional Semi-Infinite Programming Problems with Applications
- Minmax fractional programming problem involving generalized convex functions
- Optimality conditions for fractional minmax programming
- Minimax fractional integral programming problems involving univexity
- Farkas-type results for fractional programming problems
- Necessary and sufficient conditions for minimax fractional programming
- Duality for fractional minimax programming problems
- Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming
- On a refined fractional programming problem
- A note on nonlinear fractional max-min problem
Cites work
- scientific article; zbMATH DE number 4179152 (Why is no real title available?)
- scientific article; zbMATH DE number 4157184 (Why is no real title available?)
- scientific article; zbMATH DE number 192888 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- Approximation von Funktionen und ihre numerische Behandlung
- Best Rational Approximation and Strict Quasi-Convexity
- Conjugate duality in generalized fractional programming
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized linear fractional programming
- Equilibrium points of rational \(n\)-person games
- Fractional programming
- Generalized fractional programming duablity: a ratio game approach
- Generalized fractional programming: Optimality and duality theory
- Inequality systems and optimization
- Linear Programming Solutions to Ratio Games
- Zero duality gaps in infinite-dimensional programming
Cited in
(4)
This page was built for publication: A solvability theorem and minimax fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031966)