scientific article; zbMATH DE number 1383177
From MaRDI portal
Publication:4719040
The goal of this paper is to consider the following multiobjective mathematical programming: \[ (VP)\;\min f(x)\text{ s.t. }g(x)\leq 0,\;h(x)=0,\;x\in C\tag{1} \] where \[ f(x)=(f,(x),\dots,f_n(x))^T\in R^n,\;g(x)= (g_1(x), \dots,g^n(x))^T\in R^m, \] \[ h(x)=(h_1(x), \dots,h_q(x))\in R^q. \] The author proposes optimality conditions and \(\varepsilon\)-optimality conditions for problem (1) to nondifferentiable generalized convex inequality constraint, equality constraints and abstract contraints.
Recommendations
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Optimality conditions of major constraint multiobjective programming
- scientific article; zbMATH DE number 223253
- Multiobjective programming problems under generalized convexity
- scientific article; zbMATH DE number 4092681
Cited in
(11)- Optimality conditions for vector mathematical programming via a theorem of the alternative
- Optimality conditions of major constraint multiobjective programming
- scientific article; zbMATH DE number 5076090 (Why is no real title available?)
- scientific article; zbMATH DE number 3950230 (Why is no real title available?)
- scientific article; zbMATH DE number 4092681 (Why is no real title available?)
- Optimality Conditions in Multiobjective Optimization Problems
- scientific article; zbMATH DE number 177392 (Why is no real title available?)
- scientific article; zbMATH DE number 193828 (Why is no real title available?)
- scientific article; zbMATH DE number 1019601 (Why is no real title available?)
- Multi-objective mathematical programming
- A note on multiple optimality conditions for programs with convex inequality constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719040)
