Norm-based approximation in multicriteria programming.
From MaRDI portal
Publication:1416300
DOI10.1016/S0898-1221(02)00204-3zbMath1047.90062OpenAlexW2085031788MaRDI QIDQ1416300
Bernd Schandl, Margaret M. Wiecek, Kathrin Klamroth
Publication date: 14 December 2003
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(02)00204-3
Related Items (11)
An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ Constrained optimization using multiple objective programming ⋮ Norm-based approximation in \(E\)-\([0,1\) convex multi-objective programming] ⋮ Gradient based biobjective shape optimization to improve reliability and cost of ceramic components ⋮ A general approach for studying duality in multiobjective optimization ⋮ Constructing a Pareto front approximation for decision making ⋮ Balance set and Pareto solutions in linear space with application to ongoing optimal resource allocation, investment planning, production, and control problems with multiple objectives ⋮ Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization ⋮ Minsum hyperspheres in normed spaces ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Approximation methods in multiobjective programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified weighted Tchebycheff metric for multiple objective programming
- Absolute and monotonic norms
- Reference point approximation method for the solution of bicriterial nonlinear optimization problems
- Planar Weber location problems with barriers and block norms
- Introducing oblique norms into multiple criteria programming
- Scalarizing vector optimization problems
- Proper efficiency and the theory of vector maximization
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Solving min-max shortest-path problems on a network
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Approximation of the efficient point set by perturbation of the ordering cone
- An interactive weighted Tchebycheff procedure for multiple objective programming
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- A Class of Solutions for Group Decision Problems
- Norm-based approximation in bicriteria programming
This page was built for publication: Norm-based approximation in multicriteria programming.
