Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems

Related Items

Improving the performance of a traffic system by fair rerouting of travelers

Cites Work

A new polynomial-time algorithm for linear programming
Convexity and concavity properties of the optimal value function in parametric nonlinear programming
Introduction to sensitivity and stability analysis in nonlinear programming
Computable bounds on parametric solutions of convex problems
A polynomial-time algorithm, based on Newton's method, for linear programming
An interior point algorithm for semi-infinite linear programming
Differential stability in infinite-dimensional nonlinear programming
Infinitely constrained optimization problems
Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
The potential method for conditional maxima in the locally compact metric spaces
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
Differentiability of Relations and Differential Stability of Perturbed Optimization Problems
Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs
A projected lagrangian algorithm for semi-infinite programming
An exact penalty function for semi-infinite programming
Directional derivatives for the value-function in semi-infinite programming
Direct theorems in semi-infinite convex programming
Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
Generalized Gradients and Applications
Sensitivity analysis for nonlinear programming using penalty methods
Dependence of Best Rational Chebyshev Approximations on the Domain
Differentiable stability in non convex and non differentiable programming
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item