Two-Segment Separable Programming
From MaRDI portal
Publication:3205029
Cited in
(13)- On large scale nonlinear network optimization
- A global optimization method for nonconvex separable programming problems
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- A piecewise linear approximation procedure forLpnorm curve fitting
- Solving highly nonlinear convex separable programs using successive approximation
- Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach
- Mean‐standard deviation model for minimum cost flow problem
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions
- Optimal objective function approximation for separable convex quadratic programming
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Competitive facility location model with concave demand
- Computational aspects of two-segment separable programming
- A two-segment approximation algorithm for separable convex programming with linear constraints
This page was built for publication: Two-Segment Separable Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3205029)