A Simplicial Branch-and-Bound Algorithm for Production-Transportation Problems With Inseparable Concave Production Cost

Nagai, Hidetoshi; Kuno, Takahito

doi:10.15807/jorsj.48.97

Cited by 8 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On an economic scale, production costs are considered an empty operation. e proposed algorithm produces an ideal global solution to this problem of unconverted minimization in a limited time [8]. Bretthauer et al proposed a branching and constraint algorithm to solve a problem that can be separated from a convex square point with lower and upper limits of integer variables.…”

Section: Introductionmentioning

confidence: 99%

Prediction of Phase-Controlled Breaking Zero Point of Electronic and Electrical Fault Current considering Branch Definition Algorithm

Li¹

2022

Mobile Information Systems

View full text Add to dashboard Cite

Phase-control technology, which is also called simultaneous interconnection technology, is one of the latest developments in intelligent interconnection. With the subsequent development of the short-circuit system, which increased significantly, the switching capacity of the switch is tested. Applying arc power to the contact holes during a short circuit also causes extensive damage to the switch contacts, which severely affects the operation and life of the switch. To solve this problem, this paper introduces the branch definition algorithm, describes different types of faults occurring in power systems, proposes a general scheme for fault current phase-controlled breaking, derives a fault occurrence detection method and a phase control method, and performs a simulation analysis of the proposed branch definition algorithm; a single-phase short-circuit current model is built; and the algorithm is tested using simulation data. The oscilloscope acquisition data were simulated and analyzed to obtain the characteristic parameters of the waveform, and the online simulation results obtained were analyzed with the oscilloscope data. The experimental results show that the system designed in this paper can accurately predict the zero value, and the zero values obtained from four experiments conducted are 34.52 ms, 34.46 ms, 29.9 ms, and 29.84 ms, respectively.

show abstract

Section: Introductionmentioning

confidence: 99%

Prediction of Phase-Controlled Breaking Zero Point of Electronic and Electrical Fault Current considering Branch Definition Algorithm

Li¹

2022

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…Cao (1992), Dangalchev (1996), Bell et al (1999), Kuno and Utsunomiya (2000), Dangalchev (2000) and Nagai and Kuno (2005). However, research effort has been also devoted to nonlinear programming (NLP) techniques for the optimum solution of the NTP.…”

Section: Introductionmentioning

confidence: 99%

Solving the Nonlinear Transportation Problem by Global Optimization

Klanšek

Pšunder

2010

Transport

View full text Add to dashboard Cite

Abstract. The aim of this paper is to present the suitability of three different global optimization methods for specifically the exact optimum solution of the nonlinear transportation problem (NTP). The evaluated global optimization methods include the branch and reduce method, the branch and cut method and the combination of global and local search strategies. The considered global optimization methods were applied to solve NTPs with reference to literature. NTPs were formulated as nonlinear programming (NLP) optimization problems. The obtained optimal results were compared with those got from literature. A comparative evaluation of global optimization methods is presented at the end of the paper to show their suitability for solving NTPs.

show abstract

“…Although it might not be easy to identify D in general, there are a number of cases with obvious certificates. A typical example is the production-transportation problem [12,14,20,21]. This is a class of minimum concave-cost flow problems and minimizes the sum of concave production and linear transportation costs on a bipartite network (see Example 3.1 in Section 3).…”

Section: Introductionmentioning

confidence: 99%

A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems

Kuno

Nagai

2007

Comput Optim Appl

Self Cite

View full text Add to dashboard Cite

In this paper, we develop a simplicial branch-and-bound algorithm for generating globally optimal solutions to concave minimization problems with low rank nonconvex structures. We propose to remove all additional constraints imposed on the usual linear programming relaxed problem. Therefore, in each bounding operation, we solve a linear programming problem whose constraints are exactly the same as the target problem. Although the lower bound worsens as a natural consequence, we offset this weakness by using an inexpensive bound tightening procedure based on Lagrangian relaxation. After giving a proof of the convergence, we report a numerical comparison with existing algorithms.

show abstract

A Simplicial Branch-and-Bound Algorithm for Production-Transportation Problems With Inseparable Concave Production Cost

Cited by 8 publications

References 11 publications

Prediction of Phase-Controlled Breaking Zero Point of Electronic and Electrical Fault Current considering Branch Definition Algorithm

Prediction of Phase-Controlled Breaking Zero Point of Electronic and Electrical Fault Current considering Branch Definition Algorithm

Solving the Nonlinear Transportation Problem by Global Optimization

A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems

Contact Info

Product

Resources

About