Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
From MaRDI portal
Publication:3553752
DOI10.1080/02331930903500290zbMath1200.65046OpenAlexW1987632745MaRDI QIDQ3553752
Nam Nguyen Canh, Tao Pham Dinh, Hoai An Le Thi, Le Dung Muu
Publication date: 21 April 2010
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930903500290
algorithmsbranch-and-boundmulticriteria optimizationsimplicial bisectionaffine fractional criteriaLagrangian boundingscalar optimization over efficient sets
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items
Conjugate duality and optimization over weakly efficient set, Blaschke-type theorem and separation of disjoint closed geodesic convex sets, A parallel algorithm based on convexity for the computing of Delaunay tessellation
Cites Work
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Bicriteria linear fractional programming
- Fractional programming: Applications and algorithms
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- 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
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Global minimization by reducing the duality gap
- Optimizing a linear function over an efficient set
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- On solving nonconvex optimization problems by reducing the duality gap
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Connectedness in Multiple Linear Fractional Programming
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Algorithms for the vector maximization problem
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
- Lagrange Multipliers and Nonconvex Programs
- Optimization over the efficient set
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
