Pages that link to "Item:Q390484"
From MaRDI portal
The following pages link to A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484):
Displaying 18 items.
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems (Q1660296) (← links)
- Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
- Characterizations of the solution set for non-essentially quasiconvex programming (Q1686559) (← links)
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems (Q1990434) (← links)
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications (Q2025164) (← links)
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data (Q2037900) (← links)
- An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
- Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
- Optimality conditions and constraint qualifications for quasiconvex programming (Q2278888) (← links)
- Characterization of radially lower semicontinuous pseudoconvex functions (Q2302747) (← links)
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2351521) (← links)
- Characterizations of solution sets of differentiable quasiconvex programming problems (Q2420773) (← links)
- Some characterizations of approximate solutions for robust semi-infinite optimization problems (Q2664903) (← links)
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials (Q2698576) (← links)
- <i>ϵ</i>-Efficient solutions in semi-infinite multiobjective optimization (Q4634336) (← links)
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials (Q6064032) (← links)