The following pages link to R. N. Kaul (Q167936):
Displaying 50 items.
- Block truncated-Newton methods for parallel optimization (Q582212) (← links)
- (Q593639) (redirect page) (← links)
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
- Conjugate duality for vector-maximization problems (Q624559) (← links)
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs (Q630017) (← links)
- Convexity and arcwise connectedness approach to inequalities (Q699639) (← links)
- Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming (Q700265) (← links)
- Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
- On the existence of solutions to systems of vector quasi-optimization problems (Q706372) (← links)
- Optimality criteria in nonlinear programming involving nonconvex functions (Q759656) (← links)
- Generalized \((\eta,\rho)\)-invex functions and semiparametric duality models for multiobjective fractional programming problems containing arbitrary norms (Q857809) (← links)
- Continuous-time optimization problems involving invex functions (Q860670) (← links)
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems (Q868630) (← links)
- On systems of quasivariational inclusion problems of type I and related problems (Q873806) (← links)
- Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms (Q874317) (← links)
- Symmetric duality for fractional variational problems with cone constraints (Q874348) (← links)
- Karmarkar's algorithm with improved steps (Q910334) (← links)
- Erratum to: ``Non convex and semi-differentiable functions'' (Q922375) (← links)
- Some new Farkas-type results for inequality systems with DC functions (Q925237) (← links)
- Some convex programs without a duality gap (Q959958) (← links)
- Characterizations of optimal solution sets of convex infinite programs (Q1024702) (← links)
- Generalized qualification and qualification levels for spectral regularization methods (Q1035881) (← links)
- Sufficient optimality conditions using generalized convex functions (Q1053608) (← links)
- Duality in inexact fractional programming with set-inclusive constraints (Q1065723) (← links)
- Programming with semilocally quasiconvex functions (Q1079128) (← links)
- Directional derivative of marginal function in mathematical programming (Q1080367) (← links)
- Bellman functions in the optimization of dynamic systems under uncertainty (Q1086830) (← links)
- Polynomial approximation technique for dynamic optimization problems (Q1091280) (← links)
- Local decomposition methods for linear programming (Q1091939) (← links)
- Two characterization theorems in complementarity theory (Q1102208) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- Some existence theorems for functional equations arising in dynamic programming. II (Q1114599) (← links)
- Non-convex and semi-differentiable functions (Q1115355) (← links)
- Semilocal pseudolinearity and efficiency (Q1116894) (← links)
- Locally connected sets and functions (Q1117048) (← links)
- A generalized inverse method for asymptotic linear programming (Q1122475) (← links)
- A procedure for worst outcomes displacement in multiple criteria decision making (Q1122499) (← links)
- A note on nonlinear fractional vector maximization (Q1123138) (← links)
- Generalized \(\gamma\)-convex and related functions with applications to optimality (Q1125489) (← links)
- A simple proof of a complex transposition theorem (Q1160076) (← links)
- Sufficient optimality criteria in continuous time programming (Q1163476) (← links)
- Generalizations of convex and related functions (Q1172549) (← links)
- Locally connected functions and optimality (Q1176008) (← links)
- On a Lagrangian penalty function method for nonlinear programming problems (Q1186086) (← links)
- Computing efficient steady state policies for deterministic dynamic programs. I (Q1191780) (← links)
- Separable convex programs with ratio constraints over a directed tree (Q1197894) (← links)
- Computing efficient steady state policies for deterministic dynamic programs. II (Q1260897) (← links)
- Duality in pseudolinear multiobjective fractional programming (Q1261244) (← links)
- A modified simplex approach for solving bilevel linear programming problems (Q1261406) (← links)
- Weak limits of Palais-Smale sequences for a class of critical functionals (Q1315038) (← links)
