Pareto optimality in multiobjective problems
From MaRDI portal
Publication:1233815
DOI10.1007/BF01442131zbMath0346.90055OpenAlexW2010788560MaRDI QIDQ1233815
Publication date: 1978
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01442131
Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions (49K99) Numerical methods in optimal control (49M99)
Related Items (24)
Optimality and pareto optimality conditions for the problems with nonregular operator equality constraints ⋮ Unnamed Item ⋮ On some specification of the Dubovicki-Milutin theorem for Pareto optimal problems ⋮ Strong and weak conditions of regularity and optimality ⋮ Necessary conditions for Pareto optimality in simultaneous Chebyshev best approximation ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Multi-Objective Cost-Detectability in Unfalsified Adaptive Control ⋮ Necessary and sufficient optimality conditions for fractional multi-objective problems ⋮ A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions ⋮ Omni-optimizer: a generic evolutionary algorithm for single and multi-objective optimization ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Stationary Points and Necessary Conditions in Vector Extremum Problems ⋮ Multiplier rules for weak pareto optimization problems ⋮ Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm ⋮ On the conditional and partial trade credit policy with capital constraints: a Stackelberg model ⋮ Optimal control problem for infinite order hyperbolic system with mixed control-state constraints ⋮ Optimality conditions for infinite order hyperbolic control problem with non-standard functional and time delay ⋮ Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems ⋮ Characteruzation of pareto optimal points in problems with mult-eqality constraints ⋮ MIXTURE OF CONSISTENT STOCHASTIC UTILITIES AND A PRIORI RANDOMNESS ⋮ Optimality conditions for vector mathematical programming via a theorem of the alternative ⋮ AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS ⋮ A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization ⋮ Duality theorem of nondifferentiable convex multiobjective programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global analysis and economics. V: Pareto theory with constraints
- Constrained minimization under vector-valued criteria in finite dimensional spaces
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Proper efficiency and the theory of vector maximization
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- Necessary optimality criteria in mathematical programming in the presence of differentiability
- Extremum problems in the presence of restrictions
- Seven Kinds of Convexity
- Convex Analysis
- Sufficient conditions for extremum, penalty functions and regularity
This page was built for publication: Pareto optimality in multiobjective problems
