The marginal value formula in input optimization

The derivative of the optimal value function is obtained for perturbations over certain regions of stability for bi-convex optimization models. The formula has two terms:the familiar one, related to the derivative of the Lagrangian with respect to the parameters, and a new one, related to the derivative of the optimal solution function. The latter term yields an “orthogonality condition”: The derivative of the optimal solution is orthogonal to the polar set of cones of directions of constancy of “badly behaved” constraints. The formula is used in various theoretical and practical situations:First we derive conditions for an optimal input on stable paths. Then we develop an error analysis for two general classes of numerical methods of input optimization. Usefulness of the formula is demonstrated by solving a real-life problem involving the operation of a textile mill. We show how the formula can be used in nonlinear programming to calculate structural optima. Also, we apply it to the least-squares problem...

[1]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[2]  S. Zlobec,et al.  Constraint qualifications in input optimisation , 1989, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[3]  Jacques Gauvin,et al.  Directional Behaviour of Optimal Solutions in Nonlinear Mathematical Programming , 1988, Math. Oper. Res..

[4]  S. Zlobec,et al.  Characterizing optimality in mathematical programming models , 1988 .

[5]  Sanjo Zlobec,et al.  On a necessary condition for stability in perturbed linear and convex programming , 1987, Z. Oper. Research.

[6]  Sanjo Zlobec,et al.  On the continuity of a Lagrangian multiplier function in input optimization , 1986, Math. Program..

[7]  Sanjo Zlobec,et al.  Input optimization: I. Optimal realizations of mathematical models , 1985, Math. Program..

[8]  W. Hogan.  Point-to-Set Maps in Mathematical Programming , 1973 .

[9]  G. Stewart.  Introduction to matrix computations , 1973 .

[10]  M. Avriel,et al.  An extension of geometric programming with applications in engineering optimization , 1971 .

[11]  S. Zlobec.  Structural optima in nonlinear programming , 1988 .

[12]  S. Zlobec,et al.  New regions of stability in input optimization , 1988 .

[13]  Sanjo Zlobec,et al.  Stable planning by linear and convex models 2 / 3 , 1983 .

[14]  Sanjo Zlobec,et al.  Regions of stability for ill-posed convex programs , 1982 .

[15]  Aharon Ben-Tal,et al.  Optimality in nonlinear programming: A feasible directions approach , 1981 .

[16]  D. Klatte.  On the lower semicontinuity of optimal sets in convex parametric optimization , 1979 .

[17]  J. Vernon,et al.  Introduction to linear programming: Methods and cases , 1971 .