Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

DOI10.1137/1013001zbMath0232.90049OpenAlexW2107367810MaRDI QIDQ5641019

Publication date: 1971

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/304745a3dc2a1d6aff9ad5d1533ad0d4adde82a0

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Strict convex regularizations, proximal points and augmented lagrangians, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, On the rate of convergence of certain methods of centers, Convex analysis treated by linear programming, Fractional programming, Characterizations of optimality in convex programming: the nondifferentiable case, Duality theorems for certain programs involving minimum or maximum operations, A transposition theorem with applications to constrained optimal control problems, An extension of the frank and Wolfe method of feasible directions, Invex nonsmooth alternative theorem and applications^*, Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems, An algorithm for decomposing the parametric space in multiobjective dynamic programming problems, Efficiency in Multi-Objective Fractional Functional Programming, The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm, Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data, Multilinear programming: Duality theories, Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem, Exact penalty functions and stability in locally Lipschitz programming, Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions, A characterization of lower semicontinuity of constraint sets, Multiple-criterion control: A convex programming approach, Duality and symmetry in constrained estimation and control problems, Sublinear upper bounds for stochastic programs with recourse, Pre-invex functions in multiple objective optimization, Least-norm linear programming solution as an unconstrained minimization problem, Lagrange duality and partitioning techniques in nonconvex global optimization, Solving multiple-objective problems in the objective space, How to solve a design centering problem, Stability of the solution of definite quadratic programs, An algorithm for generating efficient solutions of multiobjective dynamic programming problems, Output learning and duality in joint production programs, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, The most probable allocation solution for the p-median problem, Generalization of Fenchel's duality theorem for convex vector optimization, Existence of optimal Lagrange multipliers for certain nonconvex allocation problems, Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems, A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems, Fractional programming: Applications and algorithms, An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Optimization of geometry in truss design, Duality theory for maximizations with respect to cones, A strengthened test for optimality, A unified theory of optimal multi-level control, Generalized Benders' decomposition for topology optimization problems, Saddle point optimality criteria for mathematical programming problems with equilibrium constraints, Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs, A survey on the continuous nonlinear resource allocation problem, The diagonalizability of quadratic functions and the arbitrariness of shadow prices, The factorization approach to large-scale linear programming, Solving fractional multicriteria optimization problems with sum of squares convex polynomial data, Ordering scheduling problem in manufacturing systems, Multi-period optimal investment choice post-retirement with inter-temporal restrictions in a defined contribution pension plan, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, Explicit duality for convex homogeneous programs, Hierarchical feedback control for large dynamical systems, An homage to Joseph-Louis Lagrange and Pierre Huard, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, A dynamic model for the headquarters-subsidiary relationship in MNCs, Efficiency in multiple objective optimization problems, Decentralized optimization for distributed-lag models of discrete systems, On the Pironneau-Polak method of centers, Characterizations of optimality in convex programming: the nondifferentiable case, Characterization of optimality in convex programming without a constraint qualification, The optimization of non-linear systems using a new two level method, Price optimization with reference price effects: a generalized Benders' decomposition method and a myopic heuristic approach, Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint, A duality theorem for nondifferentiable convex programming with operatorial constraints, Duality for generalized fractional programs involving n-set functions, A dual algorithm for the solution of nonlinear variational problems via finite element approximation, Mathematical Modeling of Scheduling Problems, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, A dual convex homogeneous programming problem, A subgradient duality theorem, Existence of efficient solutions for vector maximization problems, Optimal control of constrained problems by the costate coordination structure, Four solution techniques for a general one machine scheduling problem. A comparative study, Geometry of optimality conditions and constraint qualifications: The convex case, An interactive method as an aid in solving multi-objective mathematical programming problems, Decomposition and coordination methods for constrained optimization, Convexification procedures and decomposition methods for nonconvex optimization problems, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, A convex form of the quadratic assignment problem, Dorn's duality for quadratic programs revisited: The nonconvex case, Lower level duality and the global solution of generalized semi-infinite programs, Zero duality gaps in infinite-dimensional programming, Decision making under uncertainty: A semi-infinite programming approach, A primal-dual subgradient method for time staged capacity expansion planning, Ein Subgradientenverfahren zur Klassifikation qualitativer Daten, On a pair of nonlinear mixed integer programming problems, Convexity and concavity properties of the optimal value function in parametric nonlinear programming, An optimal \((Q,r)\) policy for a multipart assembly system under stochastic part procurement lead times, Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid, Global saddle-point duality for quasi-concave programs, Generalized fractional programming: Optimality and duality theory, Generalized Benders decomposition, Calculating surrogate constraints, Strong duality for standard convex programs, A theorem of the alternative with application to convex programming: optimality, duality, and stability, An elementary survey of general duality theory in mathematical programming, A note on duality gaps in linear programming over convex sets, Branch-and-reduce algorithm for convex programs with additional multiplicative constraints, Solving semidefinite quadratic problems within nonsmooth optimization algorithms, On the characterization of noninferior solutions of the vector optimization problem, A penalty function approach for solving bi-level linear programs, Applications of the method of partial inverses to convex programming: Decomposition, Implied constraints and a unified theory of duality in linear and nonlinear programming, Convexity and differentiability of controlled risk, A continuous-time generalization of Gordan's transposition theorem, 'Multidimensional' extensions and a nested dual approach for the m-median problem, Optimality conditions and Lagrangian duality in continuous-time nonlinear programming