scientific article; zbMATH DE number 7009350
From MaRDI portal
Publication:4614864
Cited in
(21)- Dual method of centers for solving generalized fractional programs
- Generating the efficient frontier of a class of bicriteria generalized fractional programming
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- On duality for a second-order multiobjective fractional programming problem involving type-I functions
- Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- Prox-regularization of the dual method of centers for generalized fractional programs
- Robust fractional programming
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Solving convex uncertain PDE-constrained multi-dimensional fractional control problems via a new approach
- Successive upper approximation methods for generalized fractional programs
- Optimizing the minimax affine fractional problem in reduced space
- Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
- A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming
- Optimality and duality results for fractional programming problems under E-univexity
- On efficient solutions of nonsmooth fractional multiobjective optimization problems with mixed constraints
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- Higher order fractional symmetric duality over cone constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614864)