scientific article; zbMATH DE number 3920182
From MaRDI portal
Publication:3694971
Recommendations
Cited in
(23)- Lagrangian dual ascent by generalized linear programming
- A scheduling model for the daily operation of an electric power system
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints
- Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory
- New descent rules for solving the linear semi-infinite programming problem
- Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.
- An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
- Linear programming, complexity. Separation and optimization.
- Lower bound shakedown analysis of layered pavements using discontinuous stress fields
- Recovering an optimal LP basis from an optimal dual solution
- An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis
- Reliable computation of minimum-time motions for manipulators moving in obstacle fields using a successive search for minimum-overload trajectories
- A quadratic programming algorithm
- A finite cutting plane method for facial disjunctive programs
- New purification algorithms for linear programming
- scientific article; zbMATH DE number 4126605 (Why is no real title available?)
- scientific article; zbMATH DE number 757651 (Why is no real title available?)
- The steepest descent gravitational method for linear programming
- Numerical algorithms for estimation and calculation of parameters in modeling pest population dynamics and evolution of resistance
- Degeneracy resolution for bilinear utility functions
- A priori stability conditions for an arbitrary number of unstable poles
- Active set algorithms for isotonic regression; a unifying framework
- Bounded isotonic median regression
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 Q3694971)
