Some duality theorems for the non-linear vector maximum problem
From MaRDI portal
Publication:5589751
Cites work
- A Duality Theorem for Convex Programs
- A duality theorem for non-linear programming
- A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
- A GENERAL DUALITY THEOREM OF CONVEX PROGRAMMING *
- Coincidence properties of birth and death processes
- Dual Programs [Letter to the Editor]
- scientific article; zbMATH DE number 3197060 (Why is no real title available?)
- scientific article; zbMATH DE number 3084780 (Why is no real title available?)
- Some duality theorems for the non-linear vector maximum problem
Cited in
(15)- On efficient sets in vector maximum problems - A brief survey
- Generalization of Fenchel's duality theorem for convex vector optimization
- Duality for nonlinear multiple-criteria optimization problems
- Super efficient solutions and super infima in vector optimization
- Multicriteria fractional programming -- an approach by means of conjugate functions
- The influence of proper efficiency on optimal solutions of scalarizing problems in multicriteria optimization
- Dualität und algorithmische anwendung beim vektoriellen standortproblem
- Duality in geometric vector optimization
- Duality in vector optimization
- The geometric vector inequality and its properties
- The geometric vector inequality and its properties
- Some duality theorems for the non-linear vector maximum problem
- A new approach to duality in vector optimization
- Nonconvex separation theorems and some applications in vector optimization
- Duality assertions in vector optimization w.r.t. relatively solid convex cones in real linear spaces
This page was built for publication: Some duality theorems for the non-linear vector maximum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589751)
