Duality in generalized fractional programming via Farkas' lemma
From MaRDI portal
Publication:1173019
Cites work
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 3480884 (Why is no real title available?)
- scientific article; zbMATH DE number 3062451 (Why is no real title available?)
- Duality for nonlinear fractional programs
- Duality in generalized linear fractional programming
- Goal programming and multiple objective optimizations. Part I
- Multiple Objective Linear Fractional Programming
Cited in
(56)- Successive upper approximation methods for generalized fractional programs
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions
- What is quasiconvex analysis?
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
- Duality for minmax programming involvingV-invex functions
- Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- Duality for minmax programming involving nonsmooth v-invex functions
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Generalized fractional programming: Optimality and duality theory
- Saddle-point type optimality criteria and duality relations for generalized fractional programming.
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- A solvability theorem and minimax fractional programming
- Convergence of interval-type algorithms for generalized fractional programming
- An effective branch and bound algorithm for minimax linear fractional programming
- Constrained ratio games and generalized fractional programming
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Generalized fractional programming duality: A parametric approach
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Fractional programming
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- A new algorithm for generalized fractional programs
- Duality for generalized fractional programs involving n-set functions
- Dual method of centers for solving generalized fractional programs
- Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
- Prox-regularization of the dual method of centers for generalized fractional programs
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
- Complex fractional programming and the Charnes-Cooper transformation
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Generalized fractional programming: Algorithms and numerical experimentation
- Continuous-time generalized fractional programming
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
- An algorithm for generalized fractional programs
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- A transposition theorem with applications to constrained optimal control problems
- Fractional programming
- Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Conjugate duality in generalized fractional programming
- Algorithms for generalized fractional programming
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- A taxonomy and review of the multi-objective fractional programming (MOFP) problems
- Generalized linear fractional programming under interval uncertainty
- Distributed function calculation over noisy networks
- Saddle-point type optimality criteria for generalized fractional programming
- Using duality to solve generalized fractional programming problems
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Duality in generalized nonlinear fractional programming
- On a dynamic fractional game
- Duality in generalized linear fractional programming
- On invexity-type nonlinear programming problems
- Fractional Programming — Some Recent Developments
- Duality in inexact fractional programming with set-inclusive constraints
- Bridging mixed integer linear programming for truss topology optimization and additive manufacturing
This page was built for publication: Duality in generalized fractional programming via Farkas' lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173019)
