Duality in generalized fractional programming via Farkas' lemma
From MaRDI portal
Publication:1173019
DOI10.1007/BF00935361zbMath0502.90079WikidataQ124969776 ScholiaQ124969776MaRDI QIDQ1173019
Raj Jagannathan, Siegfried Schaible
Publication date: 1983
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
A DC approach for minimax fractional optimization programs with ratios of convex functions, Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions, Saddle-point type optimality criteria for generalized fractional programming, Bridging mixed integer linear programming for truss topology optimization and additive manufacturing, Conjugate duality in generalized fractional programming, Generalized fractional programming duality: A parametric approach, An entropic regularized method of centers for continuous minimax problem with semi infinite constraints, Optimality conditions and duality for a class of continuous-time generalized fractional programming problems, On a dynamic fractional game, A new algorithm for generalized fractional programs, Duality for minmax \(B\)-vex programming involving \(n\)-set functions, Convergence of interval-type algorithms for generalized fractional programming, Using duality to solve generalized fractional programming problems, Dual method of centers for solving generalized fractional programs, A solvability theorem and minimax fractional programming, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution, Duality and saddle-point type optimality for generalized nonlinear fractional programming., Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions, Constrained ratio games and generalized fractional programming, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Prox-regularization of the dual method of centers for generalized fractional programs, Continuous-time generalized fractional programming, Algorithms for generalized fractional programming, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, Fractional programming, Fractional programming, Solution of some convex separable resource allocation and production planning problems with bounds on the variables, Saddle-point type optimality criteria and duality relations for generalized fractional programming., Fractional Programming — Some Recent Developments, Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program, Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions, Duality in generalized nonlinear fractional programming, Duality in generalized linear fractional programming, Generalized linear fractional programming under interval uncertainty, Duality for minmax programming involving nonsmooth v-invex functions, Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem, Duality for generalized fractional programs involving n-set functions, A modified objective function method for solving nonlinear multiobjective fractional programming problems, What is quasiconvex analysis?, A taxonomy and review of the multi-objective fractional programming (MOFP) problems, Distributed function calculation over noisy networks, Generalized fractional minimax programming with \(B-(p,r)\)-invexity, Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Generalized fractional programming: Optimality and duality theory, A transposition theorem with applications to constrained optimal control problems, An effective branch and bound algorithm for minimax linear fractional programming, Generalized fractional programming: Algorithms and numerical experimentation, An algorithm for generalized fractional programs, Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions, Duality for minmax programming involvingV-invex functions, Duality in inexact fractional programming with set-inclusive constraints, On invexity-type nonlinear programming problems, Complex fractional programming and the Charnes-Cooper transformation
Cites Work
