Duality for nonlinear multiple-criteria optimization problems

DOI10.1007/BF00934908zbMath0445.90082OpenAlexW2060923057MaRDI QIDQ1145630

Gabriel R. Bitran

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934908

zbMATH Keywords

dualityPareto optimalityefficient pointsKuhn-Tucker conditionseconomic interpretationdual matrixnonlinear multiple-criteria optimizationsaddle-point dual problemstability conceptsvector-valued duality

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (35)

A class of practical interactive branch and bound algorithms for multicriteria integer programming ⋮ A class of multiple-criteria fractional programming problems ⋮ Vector maximisation and lagrange multipliers ⋮ Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming ⋮ Higher-order duality for a class of nondifferentiable multiobjective programming problems involving generalized type I and related functions ⋮ Duality theory for preferences in multiobjective decisionmaking ⋮ Conjugate duality and optimization over weakly efficient set ⋮ Duality in nonlinear multiobjective programming using augmented Lagrangian functions ⋮ Axiomatic approach to duality in optimization ⋮ Minimization of vectors of curvilinear functionals on second-order jet bundle: dual program theory ⋮ Conjugate duality for vector-maximization problems ⋮ Nondifferentiable multiobjective second-order symmetric duality ⋮ Fractional programming: Applications and algorithms ⋮ A class of nonconvex functions and mathematical programming ⋮ Weak minimization and duality ⋮ Duality for multitime multiobjective ratio variational problems on first order jet bundle ⋮ Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions. ⋮ Duality Theory In Multiobjective Differentiable Programming ⋮ Generalised convexity and duality in multiple objective programming ⋮ Proper efficiency conditions and duality for multiobjective programming problems involving semilocally invex functions ⋮ Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions ⋮ Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization ⋮ Higher order duality in multiobjective programming with cone constraints ⋮ A survey of recent developments in multiobjective optimization ⋮ Unnamed Item ⋮ Duality in nondifferentiable vector programming ⋮ Duality and exact penalization for vector optimization via augmented Lagrangian ⋮ Symmetric duality for homogeneous multiple-objective problems ⋮ Unnamed Item ⋮ A Dual For A Multiple Objective Fractional Programming Problem ⋮ Geometric consideration of duality in vector optimization ⋮ On duality theory in multiobjective programming ⋮ Duality theory for infinite-dimensional multiobjective linear programming ⋮ On efficient sets in vector maximum problems - A brief survey ⋮ Generalized invexity and duality in multiobjective nonlinear programming.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Potential solutions of linear systems: the multi-criteria multiple constraint levels program
• Stability in multicriteria optimization
• Generalization of Fenchel's duality theorem for convex vector optimization
• Maximal vectors and multi-objective optimization
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• A duality theorem for a convex programming problem in order complete vector lattices
• The saddle point theorem of Kuhn and Tucker in ordered vector spaces
• Duality theory in multiobjective programming
• A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
• The structure of admissible points with respect to cone dominance
• Constrained minimization under vector-valued criteria in finite dimensional spaces
• Optimization theory in linear spaces. I
• Proper efficiency and the theory of vector maximization
• Optimization theory in linear spaces. II: On systems of linear operator inequalities in partially ordered normed linear spaces
• Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Strong Vector Minimization and Duality
• The geometry of Pareto efficiency over cones
• Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• Duality and Alternative in Multiobjective Optimization
• The Vector Maximization Problem: Proper Efficiency and Stability
• First Order Conditions for General Nonlinear Optimization
• Proper Efficient Points for Maximizations with Respect to Cones
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• On some relations between a dual pair of multiple objective linear programs
• On Cone-Efficiency, Cone-Convexity and Cone-Compactness
• A revised simplex method for linear multiple objective programs
• Algorithms for the vector maximization problem
• Geometry of optimality conditions and constraint qualifications
• Convex Analysis
• Some duality theorems for the non-linear vector maximum problem

This page was built for publication: Duality for nonlinear multiple-criteria optimization problems