General theorems of the alternative in variable ordering structures
From MaRDI portal
Publication:5152045
zbMATH Open1481.90262MaRDI QIDQ5152045FDOQ5152045
Authors: Johannes Jahn
Publication date: 18 February 2021
Full work available at URL: http://jnva.biemdas.com/archives/1236
Recommendations
- Optimality conditions in nonlinear vector optimization with variable ordering structures
- Generalized \((\mathcal F,\alpha , \rho , \theta )\)-\(d\)-\(V\)-univex functions and non-smooth alternative theorems
- Theorems of the alternative and optimization with set-valued maps
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Nonconvex theorems of the alternative and minimization
nonconvex optimizationnecessary optimality conditionsvector optimizationFarkas' lemmatheorems of the alternative
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Vector Optimization
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Theorems of the alternative for multifunctions with applications to optimization: General results
- Optimality conditions in nonlinear vector optimization with variable ordering structures
- Multiobjective linear programming. An introduction
- Alternative theorems and optimality conditions with weakened convexity
- The theorem of the alternative, the key-theorem, and the vector-maximum problem
- Lagrange theory of discrete-continuous nonlinear optimization
Cited In (8)
- Variable, Structure, and Restricted Generality
- The common order-theoretic structure of version spaces and ATMSs
- Isotonicity of the metric projection with respect to the mutually dual orders and complementarity problems
- Title not available (Why is that?)
- On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions
- Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities
- A first bibliography on set and vector optimization problems with respect to variable domination structures
- Gordan-type alternative theorems and vector optimization revisited
This page was built for publication: General theorems of the alternative in variable ordering structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152045)