Pages that link to "Item:Q4152352"

The following pages link to On optimality conditions in nondifferentiable programming (Q4152352):

Displaying 50 items.

• The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming (Q331995) (← links)
• Univalence and degree for Lipschitz continuous maps (Q584545) (← links)
• Nonsmooth \(\rho - (\eta , \theta )\)-invexity in multiobjective programming problems (Q691457) (← links)
• The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
• Approximate first-order and second-order directional derivatives of a marginal function in convex optimization (Q761248) (← links)
• Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential \(V\)-\(r\)-invexity (Q765245) (← links)
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155) (← links)
• Clarke's tangent vectors as tangents to Lipschitz continuous curves (Q791446) (← links)
• Local convex analysis (Q796047) (← links)
• General constraint qualifications in nondifferentiable programming (Q920847) (← links)
• Allocating procurement to capacitated suppliers with concave quantity discounts (Q924901) (← links)
• Simplex-inspired algorithms for solving a class of convex programming problems (Q941039) (← links)
• On constraint qualifications in nonlinear programming (Q955633) (← links)
• Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
• Greedy approaches for a class of nonlinear generalized assignment problems (Q968176) (← links)
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
• Optimality conditions in nondifferentiable programming and their applications to best approximations (Q1053978) (← links)
• Homeomorphisms and generalized derivatives (Q1079677) (← links)
• Superlinear convergence of a trust region type successive linear programming method (Q1102881) (← links)
• Global invertibility of nonsmooth mappings (Q1116444) (← links)
• Hadamard's theorem for locally Lipschitzian maps (Q1163662) (← links)
• On the Caratheodory-John multiplier rule (Q1164846) (← links)
• Multiplier rules and the separation of convex sets (Q1169412) (← links)
• Refinements of necessary optimality conditions in nondifferentiable programming. I (Q1251190) (← links)
• Constraint qualifications in nonsmooth multiobjective optimization (Q1594878) (← links)
• A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization (Q1614693) (← links)
• Saddle point criteria in multiobjective fractional programming involving exponential invexity (Q1714034) (← links)
• A polynomial time algorithm for convex cost lot-sizing problems (Q1785380) (← links)
• Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions (Q1816683) (← links)
• Three types dual model for minimax fractional programming (Q1972503) (← links)
• Optimality conditions for nonconvex nonsmooth optimization via global derivatives (Q1985279) (← links)
• Second-order necessary conditions in locally Lipschitz optimization with inequality constraints (Q2017828) (← links)
• The stochastic transportation problem with single sourcing (Q2275818) (← links)
• Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
• Necessary optimality conditions in terms of convexificators in Lipschitz optimization (Q2370062) (← links)
• KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions (Q2444417) (← links)
• Optimality and duality for multiobjective fractional programming involving nonsmooth generalized \((\mathcal F, b, \phi, \rho, \theta)\)-univex functions (Q2448819) (← links)
• Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity (Q2468342) (← links)
• On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
• (Φ, ρ)-Invexity in Nonsmooth Optimization (Q3083512) (← links)
• LIPSCHITZ<i>r</i>-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING (Q3148350) (← links)
• A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization (Q3179268) (← links)
• A better insight into the generalized gradient of the absolute value of a function (Q3314090) (← links)
• Generalized convexity in nondifferentiable programming (Q3338844) (← links)
• Invexity: an updated survey and new results for nonsmooth functions (Q3354478) (← links)
• Solvability results for sublinear functions and operators (Q3471115) (← links)
• Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming (Q3471126) (← links)
• Nonsmooth invexity (Q3496163) (← links)
• Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems (Q3648623) (← links)
• Exact penalty functions and stability in locally Lipschitz programming (Q3714912) (← links)