A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming

Journal of Applied Mathematics- United States

doi 10.1155/2013/984168

Full Text

Abstract

Available in

Date

Authors

Publisher

Hindawi Limited

Related search

Inner Approximation Algorithm for Generalized Linear Multiplicative Programming Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2018English

A Branch-And-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1971English

An Effective Branch-And-Bound Algorithm for Convex Quadratic Integer Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Duality in Stochastic Linear and Dynamic Programming

Lecture Notes in Economics and Mathematical Systems
MathematicsEconomicsEconometricsFinance
1986English

A Branch & Bound Algorithm for the Open-Shop Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1997English

Linear Programming Bounds for Codes via a Covering Argument

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2008English

A Branch-And-Bound Algorithm for Quadratically-Constrained Sparse Filter Design

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2013English

An Interval Branch and Bound Algorithm for Parameter Estimation and Application to Stereovision

2019English

Global Optimization for Generalized Linear Multiplicative Programming Using Convex Relaxation

Mathematical Problems in Engineering
MathematicsEngineering
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy