The following pages link to A simplified test for optimality (Q1236066):
Displaying 16 items.
- Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
- Characterizing optimality in mathematical programming models (Q1108200) (← links)
- Regularizing the abstract convex program (Q1156085) (← links)
- A strengthened test for optimality (Q1159136) (← links)
- Method of reduction in convex programming (Q1169402) (← links)
- A saddle-point characterization of Pareto optima (Q1340067) (← links)
- Partly convex programming and Zermelo's navigation problems (Q1904650) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- (Q3342228) (← links)
- Input optimization: I. Optimal realizations of mathematical models (Q3718494) (← links)
- Geometry of optimality conditions and constraint qualifications: The convex case (Q3877415) (← links)
- Complete characterization of optimality for convex programming in banach spaces<sup>†</sup> (Q3890447) (← links)
- (Q3941200) (← links)
- Una caracterización dual de optimalidad para optimización convexa (Q3971487) (← links)
- Characterizing an optimal input in perturbed convex programming (Q4742581) (← links)
- A mathematical formulation of time-cost and reliability optimization for supply chain management in research-development projects (Q5244310) (← links)
