Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
From MaRDI portal
(Redirected from Publication:3553752)
Recommendations
- Bilinear programming approach to optimization over the efficient set of a vector affine fractional problem.
- An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem.
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- On the parametric affine variational inequality approach to linear fractional vector optimization problems
- An algorithm for optimizing over the weakly-efficient set
Cites work
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Algorithms for the vector maximization problem
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- Bicriteria linear fractional programming
- Connectedness in Multiple Linear Fractional Programming
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Fractional programming: Applications and algorithms
- Global minimization by reducing the duality gap
- Lagrange Multipliers and Nonconvex Programs
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- On solving nonconvex optimization problems by reducing the duality gap
- Optimization over the efficient set
- Optimizing a linear function over an efficient set
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
Cited in
(6)- An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem.
- Bilinear programming approach to optimization over the efficient set of a vector affine fractional problem.
- Conjugate duality and optimization over weakly efficient set
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- A parallel algorithm based on convexity for the computing of Delaunay tessellation
This page was built for publication: Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553752)
