Pages that link to "Item:Q1240663"
From MaRDI portal
The following pages link to Saddle-point optimality criteria of continuous time programming without differentiability (Q1240663):
Displaying 10 items.
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems (Q445341) (← links)
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems (Q625648) (← links)
- Vector continuous-time programming without differentiability (Q966105) (← links)
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming (Q1074501) (← links)
- Some remarks concerning duality for continuous-time programming problems (Q1084028) (← links)
- Sufficient optimality criteria in continuous time programming (Q1163476) (← links)
- A sufficient optimality criterion in continuous time programming for generalized convex functions (Q1248463) (← links)
- Saddlepoint of continuous time programming having inequality and equality constraints (Q1252162) (← links)
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions (Q2132131) (← links)
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems (Q2881894) (← links)
