scientific article; zbMATH DE number 757675
From MaRDI portal
Publication:4833804
zbMath0821.90096MaRDI QIDQ4833804
Publication date: 23 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Solving set-valued optimization problems using a multiobjective approach, An algebra-based approach for linearly constrained concave minimization, Unnamed Item, Robust storage loading problems with stacking and payload constraints, A norm minimization-based convex vector optimization algorithm, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Multiplicative programming problems: Analysis and efficient point search heuristic, Decomposition approach for the global minimization of biconcave functions over polytopes, Piece adding technique for convex maximization problems, Convex Maximization via Adjustable Robust Optimization, On the complexity of detecting convexity over a box, The profit maximization problem in economies of scale, Solving polyhedral d.c. optimization problems via concave minimization, A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization, Solving sum of ratios fractional programs via concave minimization, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Maximization of generalized convex functionals in locally convex spaces., Fractional programming with convex quadratic forms and functions, On measuring the inefficiency with the inner-product norm in data envelopment analysis, A continuous knapsack problem with separable convex utilities: approximation algorithms and applications, Inscribed ball and enclosing box methods for the convex maximization problem, Generalized \(\gamma\)-valid cut procedure for concave minimization, Subdivision of simplices relative to a cutting plane and finite concave minimization, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, A dynamic inventory model with supplier selection in a serial supply chain structure
