Constrained optimization using multiple objective programming

DOI10.1007/s10898-006-9052-xzbMath1156.90017OpenAlexW1991402596MaRDI QIDQ878220

Jørgen Tind, Kathrin Klamroth

Publication date: 26 April 2007

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9052-x

zbMATH Keywords

Lagrange multipliersConvergenceConstrained optimizationMultiple objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Bi-dimensional knapsack problems with one soft constraint, Relationships between constrained and unconstrained multi-objective optimization and application in location theory, Vectorial penalisation in vector optimisation in real linear-topological spaces, An enumerative algorithm for solving nonconvex dynamic DEA models, Unnamed Item, On some methods to derive necessary and sufficient optimality conditions in vector optimization, A distance-based measure of super efficiency in data envelopment analysis: An application to gas companies, An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems, A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs, Greedy algorithms for a class of knapsack problems with binary weights, Comparison of some scalarization methods in multiobjective optimization, A multi-criteria approach to approximate solution of multiple-choice knapsack problem, Nonconvex constrained optimization by a filtering branch and bound, Multi-choice multi-objective mathematical programming model for integrated production planning: a case study, On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Multiobjective programming and planning
• The convergence rate of the sandwich algorithm for approximating convex functions
• Existence of efficient solutions for vector maximization problems
• Mean value cross decomposition applied to integer programming problems
• Norm-based approximation in multicriteria programming.
• Multicriteria optimization
• Introducing oblique norms into multiple criteria programming
• On min-norm and min-max methods of multi-objective optimization
• Unbiased approximation in multicriteria optimization
• Scalarizing vector optimization problems
• Analysis of an algorithm for approximating convex bodies
• Interactive decision maps. Approximation and visualization of Pareto frontier
• A discussion of scalarization techniques for multiple objective integer programming
• Proper efficiency and the theory of vector maximization
• Disjunctive Programming
• On the connections between semidefinite optimization and vector optimization
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Convex Analysis
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
• Problems and methods with multiple objective functions
• Nonlinear programming without a penalty function.