scientific article

Sanjo Zlobec, Adi Ben-Israel, Aharon Ben-Tal

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

optimality conditions computational methods constraint qualification numerical techniques necessary and sufficient condition Pareto optimization Chebyshev solutions of nonfeasible programs dual optimality condition feasible directions approach lexicographic multicriteria programming second order directions

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (51)

Facial reduction in partially finite convex programming ⋮ A saddle-point characterization of Pareto optima ⋮ Stable parametric programming^* ⋮ The marginal value formula in input optimization ⋮ Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications ⋮ Input optimization: I. Optimal realizations of mathematical models ⋮ Semidifferentiable functions and necessary optimality conditions ⋮ Optimality and duality without a constraint qualification for minimax programming ⋮ An Algorithm for Maximizing a Convex Function Based on Its Minimum ⋮ A simple constraint qualification in infinite dimensional programming ⋮ Partly convex programming and Zermelo's navigation problems ⋮ Characterizing optimality in mathematical programming models ⋮ LFS functions in multi-objective programming ⋮ New regions of stability in input optimization ⋮ Characterizing an optimal input in perturbed convex programming: Corrigendum ⋮ A new algorithm for generalized fractional programs ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Unnamed Item ⋮ Optimality theory for semi-infinite linear programming^∗ ⋮ Input optimization: III. optimal realizations of multiobjective models ⋮ Strong duality and minimal representations for cone optimization ⋮ Regularizing the abstract convex program ⋮ A note on multiple optimality conditions for programs with convex inequality constraints ⋮ Method of reduction in convex programming ⋮ A first order method for finding minimal norm-like solutions of convex optimization problems ⋮ Active set strategies in an ellipsoid algorithm for nonlinear programming ⋮ Decision principles derived from risk measures ⋮ Three types dual model for minimax fractional programming ⋮ Unnamed Item ⋮ Stability of efficiency evaluations in data envelopment analysis ⋮ Generalizations of Slater's constraint qualification for infinite convex programs ⋮ An optimality condition for a nondifferentiable convex program ⋮ A chain rule for parabolic second-order epiderivatives ⋮ An ellipsoid algorithm for nonlinear programming ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Value functions, domination cones and proper efficiency in multicriteria optimization ⋮ Metric regularity, tangent sets, and second-order optimality conditions ⋮ Relación entre conos de direcciones decrecientes y conos de direcciones de descenso ⋮ Mixed duality without a constraint qualification for minimax fractional programming ⋮ Finite dimensional second order optimality conditions ⋮ Theorems of the alternative and optimality conditions ⋮ Duality without a constraint qualification for minimax fractional programming ⋮ Characterizing an optimal input in perturbed convex programming ⋮ Necessary and sufficient conditions for quadratic minimality ⋮ Optimality conditions in nondifferentiable programming and their applications to best approximations ⋮ Numerical decomposition of a convex function ⋮ A simple constraint qualification in convex programming ⋮ Implementation of a subgradient projection algorithm II ⋮ A new dual problem for nondifferentiable convex programming ⋮ Calculus for parabolic second-order derivatives ⋮ Nonlinear one-parametric bottleneck linear programming

This page was built for publication: