Duality in generalized linear fractional programming
From MaRDI portal
Publication:3040945
DOI10.1007/BF02591908zbMATH Open0526.90083MaRDI QIDQ3040945FDOQ3040945
Jacques A. Ferland, S. Schaible, J.-P. Crouzeix
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
fractional programmingfiniteness conditionsquasiconvex programmingdual programcomplementarity slackness
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
- Fractional Programming. I, Duality
- Goal programming and multiple objective optimizations. Part I
- Multicriteria Programming for Financial Planning
- On An Invariant of Plane Regions and Mass Distributions
- Duality in Fractional Programming: A Unified Approach
- Bibliography in fractional programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- Best Rational Approximation and Strict Quasi-Convexity
- Duality in generalized fractional programming via Farkas' lemma
- Global saddle-point duality for quasi-concave programs, II
- Duality in mathematical programming and some problems of convex analysis
- Dualitätstheorie für hyperboiisehe und stückweise lineare konvexe optimierungsprobleme
- Duality for a class of quasiconvex programs
Cited In (74)
- A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints
- Mixed duality without a constraint qualification for minimax fractional programming
- Saddle-point type optimality criteria and duality relations for generalized fractional programming.
- Duality for minmax programming involving nonsmooth v-invex functions
- Formulating the mixed integer fractional posynomial programming
- Successive upper approximation methods for generalized fractional programs
- Fractional programming approach to a cost minimization problem in electricity market
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
- Generalized fractional programming duality: A parametric approach
- Duality for minmax programming involvingV-invex functions
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- A new algorithm for generalized fractional programs
- Non-differentiable pseudo-convex functions and duality for minimax programming problems
- Method of centers for generalized fractional programming
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- A global optimization approach to fractional optimal control
- Conjugate duality in generalized fractional programming
- Duality in generalized nonlinear fractional programming
- Duality for generalized fractional programs involving n-set functions
- A note on fractional minmax programs containing \(n\)-set functions
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions
- On invexity-type nonlinear programming problems
- A dual scheme for solving linear countable semi-infinite fractional programming problems
- Pareto optimality conditions and duality for vector quadratic fractional optimization problems
- A solvability theorem and minimax fractional programming
- Partial linearization for generalized fractional programming
- Dual method of centers for solving generalized fractional programs
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Fractional Programming — Some Recent Developments
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- On a dynamic fractional game
- Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming
- Using duality to solve generalized fractional programming problems
- Three types dual model for minimax fractional programming
- Prox-dual regularization algorithm for generalized fractional programs
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Bibliography in fractional programming
- Lower subdifferentiability in minimax fractional programming*
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
- Generalized linear fractional programming under interval uncertainty
- Duality in generalized fractional programming via Farkas' lemma
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- Generalized fractional programming: Optimality and duality theory
- Constrained ratio games and generalized fractional programming
- Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
- Continuous-time generalized fractional programming
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Duality without a constraint qualification for minimax fractional programming
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions
- Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity
- Optimality and duality without a constraint qualification for minimax programming
- Convergence of interval-type algorithms for generalized fractional programming
- Quasiconvex duality theory by generalized conjugation methods
- An algorithm for generalized fractional programs
- A proximal point algorithm for generalized fractional programs
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Prox-regularization of the dual method of centers for generalized fractional programs
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Duality in inexact fractional programming with set-inclusive constraints
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Generalized fractional programming: Algorithms and numerical experimentation
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- Algorithms for generalized fractional programming
- Strong duality for robust minimax fractional programming problems
- A transposition theorem with applications to constrained optimal control problems
- Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs
- Minimax fractional programming involving generalised invex functions
This page was built for publication: Duality in generalized linear fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3040945)
