Utility function programs and optimization over the efficient set in multiple-objective decision making
type: Item
instance of: scholarly article
title: Utility function programs and optimization over the efficient set in multiple-objective decision making
zbMATH Open document ID: 0871.90072
DOI: 10.1023/A:1022659523991
published in: Journal of Optimization Theory and Applications
publication date: 1997-10-09T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1016907
zbMATH Keywords: branch-and-bound
zbMATH Keywords: multiple-objective optimization
zbMATH Keywords: utility function program
zbMATH Keywords: \(\varepsilon\)-approximate global solution
author: Reiner Horst
author: Nguyen Van Thoai
describes a project that uses: Global Optimization Toolbox For Maple
MaRDI profile type: Publication
cites work: Q3716769
cites work: Q4001824
cites work: Advances in multicriteria analysis
cites work: A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
cites work: Q4889854
cites work: Introduction to global optimization
cites work: Handbook of global optimization
cites work: Algorithms for the vector maximization problem
cites work: Computational experience concerning payoff tables and minimum criterion values over the efficient set
cites work: Optimization over the efficient set
cites work: An all-linear programming relaxation algorithm for optimizing over the efficient set
cites work: A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
cites work: Q4296848
cites work: An algorithm for optimizing over the weakly-efficient set
cites work: Optimization over the efficient set using an active constraint approach
cites work: Q4296156
cites work: A cutting plane algorithm for convex programming that uses analytic centers
cites work: A Potential Reduction Algorithm Allowing Column Generation
cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
cites work: Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
cites work: New LP bound in multivariate Lipschitz optimization: Theory and applications
cites work: Linearly constrained global minimization of functions with concave minorants
cites work: Q3702408
cites work: Geometric algorithms and combinatorial optimization
cites work: Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3818127
cites work: On the convergence of the method of analytic centers when applied to convex quadratic programs
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Outer approximation by polyhedral convex sets
cites work: Q4833810
cites work: A relaxation method for nonconvex quadratically constrained quadratic programs
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
full work available at URL: a:1022659523991
OpenAlex ID: W1538432870
description: scientific article; zbMATH DE number 1016907