On constructing total orders and solving vector optimization problems with total orders
From MaRDI portal
Publication:540702
DOI10.1007/S10898-010-9576-YzbMATH Open1242.90214OpenAlexW2018971922MaRDI QIDQ540702FDOQ540702
Mustafa Soyertem, Mahide Küçük, Yalçin Küçük
Publication date: 3 June 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9576-y
Recommendations
- Some characterizations of solution sets of vector optimization problems with generalized order
- Optimality conditions for vector optimization problems with variable ordering structures
- Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
- Concepts for approximate solutions of vector optimization problems with variable order structures
- Vector optimization problems with generalized functional constraints in variable ordering structure setting
- Efficiencies and optimality conditions in vector optimization with variable ordering structures
- Existence theorems in vector optimization with generalized order
- \(E\)-optimal elements of vector optimization problems with variable ordering structures
- Optimality conditions in nonlinear vector optimization with variable ordering structures
- Properly optimal elements in vector optimization with variable ordering structures
Cites Work
- Optimality conditions for set-valued optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of recent developments in multiobjective optimization
- Pareto optimality, game theory and equilibria
- Title not available (Why is that?)
- Concrete representation of abstract (M)-spaces. (A characterization of the space of continuous functions.)
- An Existence Theorem in Vector Optimization
- Notwendige Optimalitätsbedingungen und ihre Anwendung
Cited In (18)
- Continuity properties of solution maps of parametric lexicographic equilibrium problems
- Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
- A lexicographical order induced by Schauder bases
- Well-Posedness for Lexicographic Vector Equilibrium Problems
- Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
- Evaluation of optimization by a total order in Rn1
- Ordered OLPS and CF \(n\)th numerators
- Interval-valued seminormed fuzzy operators based on admissible orders
- Step-affine functions, halfspaces, and separation of convex sets with applications to convex optimization problems
- Tykhonov well-posedness for lexicographic equilibrium problems
- The generalization of total ordering cones and vectorization to separable Hilbert spaces
- Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
- On the Scalarization of Set-Valued Optimization Problems with Respect to Total Ordering Cones
- Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
- Various types of well-posedness for vector equilibrium problems with respect to the lexicographic order
- The convex vector programming on an order complete ordered topological vector space
- New coupled fixed point theorems in cone metric spaces with applications to integral equations and Markov process
- Semicontinuity and closedness of parametric generalized lexicographic quasiequilibrium problems
This page was built for publication: On constructing total orders and solving vector optimization problems with total orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540702)
