Pages that link to "Item:Q1248463"
From MaRDI portal
The following pages link to A sufficient optimality criterion in continuous time programming for generalized convex functions (Q1248463):
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)
- Sufficient optimality conditions in continuous-time nonlinear programming (Q1067197) (← 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)
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions (Q2132131) (← links)
- Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities (Q2639329) (← links)
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems (Q2881894) (← links)
- Continuous-time linear programming problems revisited: A perturbation approach (Q4916307) (← links)
