Pages that link to "Item:Q1315435"

The following pages link to A Farkas lemma for difference sublinear systems and quasidifferentiable programming (Q1315435):

Displaying 9 items.

• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
• On constraint qualifications in nonlinear programming (Q955633) (← links)
• A new version of Farkas' lemma and global convex maximization (Q1312036) (← links)
• Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971) (← links)
• Characterizing global optimality for DC optimization problems under convex inequality constraints (Q1924070) (← links)
• Solvability theorems for classes of difference convex functions (Q4306584) (← links)
• Vector subdifferentials via recession mappings^∗^∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef: (Q4351789) (← links)
• A New Constraint Qualification and Sharp Optimality Conditions for Nonsmooth Mathematical Programming Problems in Terms of Quasidifferentials (Q4971017) (← links)
• On minty variational principle for quasidifferentiable vector optimization problems (Q5882233) (← links)