scientific article; zbMATH DE number 3528040
From MaRDI portal
Publication:4105489
Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Linear programming (90C05) Integer programming (90C10) Convex programming (90C25) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)
Cited in
(36)- Influence graphs and the generalized finite difference method
- Numeric computation of the projection of a point onto a polyhedron
- Sensitivity analysis in discounted Markovian decision problems
- Consistency of a linear system of inequalities
- A visual interactive method for solving the multiple criteria problem
- Grid orthogonalization for curvilinear alternating-direction techniques
- A computable convex programming characterization of optimal interpolatory quadratic splines with free knots
- Solving highly nonlinear convex separable programs using successive approximation
- On orthogonal linear \(\ell_1\) approximation
- Characterizing optimality in mathematical programming models
- Numerical study of some feasible direction methods in mathematical programming
- Some implementation issues associated with multidimensional interval Newton methods
- A purification algorithm for semi-infinite programming
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- On a socioeconomic mathematical model and its calibration
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
- Algorithms for a class of computer-aided design problems: A review
- An improved subgradient method for constrained nondifferentiable optimization
- On the rate of convergence of two minimax algorithms
- Global convergence and rate of convergence of a method of centers
- On the qualitative approximation of Lipschitzian functions.
- Speeding up Karmarkar's algorithm for multicommodity flows
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- scientific article; zbMATH DE number 3941380 (Why is no real title available?)
- Entscheidungsmodelle über angeordneten körpern
- Computer programs for non‐linear programming
- Stochastic programs as non-zero sum games
- Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
- An algorithm for hierarchical optimization of large-scale problems with nested structure
- Joint effects of the liability network and portfolio overlapping on systemic financial risk: contagion and rescue
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- The steepest descent gravitational method for linear programming
- Mathematical programming via the least-squares method
- Subjective principal component analysis
- A big-M type method for the computation of projections onto polyhedrons
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
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 Q4105489)
