Constrained optimization using multiple objective programming
From MaRDI portal
Recommendations
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- On the convergence of reference point methods in multiobjective programming
- An augmented Lagrange function method for multicriterion optimization problems
- scientific article; zbMATH DE number 3856799
- scientific article; zbMATH DE number 2209474
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 4216876 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1100795 (Why is no real title available?)
- scientific article; zbMATH DE number 1738108 (Why is no real title available?)
- scientific article; zbMATH DE number 1776908 (Why is no real title available?)
- scientific article; zbMATH DE number 2159088 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3343611 (Why is no real title available?)
- scientific article; zbMATH DE number 2222828 (Why is no real title available?)
- A discussion of scalarization techniques for multiple objective integer programming
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Analysis of an algorithm for approximating convex bodies
- Convex Analysis
- Disjunctive Programming
- Existence of efficient solutions for vector maximization problems
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Introducing oblique norms into multiple criteria programming
- Mean value cross decomposition applied to integer programming problems
- Multicriteria optimization
- Multiobjective programming and planning
- Nonlinear programming without a penalty function.
- Norm-based approximation in multicriteria programming.
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On min-norm and min-max methods of multi-objective optimization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- On the connections between semidefinite optimization and vector optimization
- Problems and methods with multiple objective functions
- Proper efficiency and the theory of vector maximization
- Scalarizing vector optimization problems
- The convergence rate of the sandwich algorithm for approximating convex functions
- Unbiased approximation in multicriteria optimization
Cited in
(20)- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- Solving the multiobjective quasi-clique problem
- scientific article; zbMATH DE number 7644921 (Why is no real title available?)
- The constraint degree analysis of multi-objective programming problems
- Multi-choice multi-objective mathematical programming model for integrated production planning: a case study
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- A distance-based measure of super efficiency in data envelopment analysis: An application to gas companies
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Nonconvex constrained optimization by a filtering branch and bound
- Bi-dimensional knapsack problems with one soft constraint
- Constrained multifidelity optimization using model calibration
- Greedy algorithms for a class of knapsack problems with binary weights
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory
- An enumerative algorithm for solving nonconvex dynamic DEA models
- Comparison of some scalarization methods in multiobjective optimization
- On some methods to derive necessary and sufficient optimality conditions in vector optimization
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- Vectorial penalisation in vector optimisation in real linear-topological spaces
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
This page was built for publication: Constrained optimization using multiple objective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878220)
