scientific article; zbMATH DE number 757675
From MaRDI portal
Publication:4833804
zbMATH Open0821.90096MaRDI QIDQ4833804FDOQ4833804
Authors: Harold P. Benson 
Publication date: 23 May 1995
Title of this publication is not available (Why is that?)
Recommendations
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (41)
- Title not available (Why is that?)
- Maximization of generalized convex functionals in locally convex spaces.
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- On the global minimization of concave functions
- PaMILO: a solver for multi-objective mixed integer linear optimization and beyond
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Solving polyhedral d.c. optimization problems via concave minimization
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Sign reversion approach to concave minimization problems
- On measuring the inefficiency with the inner-product norm in data envelopment analysis
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Piece adding technique for convex maximization problems
- A norm minimization-based convex vector optimization algorithm
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Robust storage loading problems with stacking and payload constraints
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- The profit maximization problem in economies of scale
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Generalized \(\gamma\)-valid cut procedure for concave minimization
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- Title not available (Why is that?)
- Fractional programming with convex quadratic forms and functions
- Convex Maximization via Adjustable Robust Optimization
- Solving set-valued optimization problems using a multiobjective approach
- Computational complexity and algorithms for two scheduling problems under linear constraints
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- Title not available (Why is that?)
- Concave Minimization Via Collapsing Polytopes
- Title not available (Why is that?)
- Solving sum of ratios fractional programs via concave minimization
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
- Global minimization algorithms for concave quadratic programming problems
- A dynamic inventory model with supplier selection in a serial supply chain structure
- On the complexity of detecting convexity over a box
- An algebra-based approach for linearly constrained concave minimization
- Enumerative techniques for solving some nonconvex global optimization problems
- Title not available (Why is that?)
- Inscribed ball and enclosing box methods for the convex maximization problem
- Methods for Global Concave Minimization: A Bibliographic Survey
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 Q4833804)
