scientific article; zbMATH DE number 3748742

Authors C. M. Shetty, Mokhtar S. Bazaraa

Publication date 1979

computational methods constraint qualifications Lagrangian duality methods of feasible directions optimality conditions optimization penalty and barrier functions saddle point separable programming unconstrained optimization

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx)

Cited in

(only showing first 100 items - show all)

The radar method: An effective line search for piecewise linear concave functions
Efficient solution approaches for a discrete multi-facility competitive interaction model
On filter-successive linearization methods for nonlinear semidefinite programming
Ein modifiziertes Newton-Verfahren zur Lösung des Hochrechnungsproblems nach dem Prinzip des minimalen Informationsverlustes. (A modified Newton- algorithm for the adjustment of microdata with minimum information loss)
On the uniqueness of optimal solutions in continuous location theory
A unified approach to the feasible direction methods for nonlinear programming with linear constraints
Generality of a strength model for three conditions of repeated recall
The bound improving sequence algorithm
A restriction and feasible direction algorithm for a capacity expansion problem
On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
The optimality of balancing workloads in certain types of flexible manufacturing systems
A gradient algorithm for chance constrained nonlinear goal programming
On the duality between locally optimal tests and optimal experimental designs
Finiteness in restricted simplicial decomposition
The shortest path problem with two objective functions
A computable convex programming characterization of optimal interpolatory quadratic splines with free knots
A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
A decentralized approach to integrated flight control synthesis
The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
Interactive algorithms for multiple criteria nonlinear programming problems
A nonlinear hierarchical approach for incorporating solar generation units in electric utility capacity expansion plans
Optimum positioning of moving service facility
Solving highly nonlinear convex separable programs using successive approximation
Global convergence and stabilization of unconstrained minimization methods without derivatives
Singularity theory for nonlinear optimization problems
MOLP with an interactive assessment of a piecewise linear utility function
Fractional programming revisited
Age dependent perishability in two-echelon serial inventory systems
Optimization algorithms for a class of nonlinear programming problems
A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
Congested network flows: Time-varying demands and start-time policies
On the convergence of reference point methods in multiobjective programming
A note on solving quadratic programs using mixed-integer programming
Constrained optimal designs
C-programming: A nonlinear parametric optimization method
A procedure for worst outcomes displacement in multiple criteria decision making
Lagrangian dual ascent by generalized linear programming
Analysis of a class of fractional programming problems
Design of electronic assembly lines: An analytical framework and its application
Solving convex programming problems with equality constaints by neural networks
Joint product durability and lot sizing models
The newsboy problem under progressive multiple discounts
A discretizing algorithm for location problems
Pareto optima of isostatic trusses
On the equivalence between the safety first and min-variance criterion for portfolio selection
Multiplier rules and the separation of convex sets
Convergence rate analysis of the state increment dynamic programming method
Generalizations of convex and related functions
Using efficient feasible directions in interactive multiple objective linear programming
The continuous modular design problem with linear separable side constraints
Multi-level programming and conflict resolution
SQVAM: A variance minimizing algorithm
A characterization of weak-monotone matrices
An \((s,Q)\) policy with setup reduction in a single-stage batch manufacturing system
Computing efficient steady state policies for deterministic dynamic programs. I
\(D\)-invexity and optimality conditions
Invariant admissible and optimal designs in cubic regression on the \(\nu\)-ball
Complete decomposition algorithm for nonconvex separable optimization problems and applications
A nonlinear optimization approach for solving facility layout problems
Relaxations for probabilistically constrained programs with discrete random variables
Multi-period production control in a centralized fully flexible manufacturing system
On the economic lot scheduling problem with backlogging: The common cycle approach
An approximate method for local optima for nonlinear mixed integer programming problems
Circumventing the Babuška-Brezzi condition in mixed finite element approximations of elliptic variational inequalities
On the optimality of differentiable nonconvex n-set functions
Duality in generalized nonlinear fractional programming
Evaluation of optimization methods for machining economics models
Uncertainty measures for evidental reasoning. II: A new measure of total uncertainty
A supermemory gradient projection algorithm for optimization problems with nonlinear constraints
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
Nonlinear programming analysis to estimate implicit inventory backorder costs
Cone concavity and multiple-payoff constrained n-person games
Generalized bilinear programming: An application in farm management
Integration of operation routing and economic production quantity decisions in batch manufacturing systems
Implied constraints and an alternate unified development of nonlinear programming theory
A linear approximation model for the parameter design problem
A simple SLP algorithm for solving a class of nonlinear programs
Necessary and sufficient conditions for minimax fractional programming
Optimization model and algorithm for system operation division of labor at two-way marshaling station
Computation of optimal feedforward and feedback control by a modified reduced gradient method
Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
On the \((t,S_ j)\) policy in an integrated production/inventory model with time-proportional demand
A penalty function approach for solving bi-level linear programs
\(D\)-optimum designs for the linear logistic model when restrictions exist on \(p\)
A finite algorithm for solving general quadratic problems
The simplex method as a global optimizer: A C-programming perspective
On assessing the \(H\) value in fuzzy linear regression
A regularized stochastic decomposition algorithm for two-stage stochastic linear programs
Equilibria in a stochastic resource management game under imperfect information
Implied constraints and a unified theory of duality in linear and nonlinear programming
Bandwidth allocation in ATM networks
Primal-relaxed dual global optimization approach
Partial linearization methods in nonlinear programming
Optimality conditions and duality in subdifferentiable multiobjective fractional programming
Learning rules for a fuzzy inference model
A unified description of iterative algorithms for traffic equilibria
A comparative analysis of different specifications of modal choice models in an urban area
A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3932576)