×

DISNEL: An application package for solving discrete and nonlinear optimization problems. (English. Russian original) Zbl 0763.65044

Cybernetics 27, No. 3, 354-366 (1991); translation from Kibernetika 1991, No. 3, 36-45 (1991).
The paper describes the features of the DISNEL package for interactive solution of a wide range of discrete and nonlinear optimization problems on compatible models of ES computers (ES-1022 and higher) under ES/OS (version 6.1 and higher) or BOS SVM. The package was developed at the Glushkov Institute of Cybernetics of the Ukrainian Academy of Sciences. It is an improvement over two earlier packages of the same family: DISPRO (discrete optimization) and PLANER (nonlinear programming).
In addition to solving the standard ILP and mixed ILP, the package also solves one-parameter linear discrete models and different types of location and extremal combinatorial problems. For these problems, special-purpose (rather than general) methods have been developed. The package also includes modules for solving nonlinear programs, including those that rely on nonsmooth techniques.
The general nonlinear program is solved by a method of B. N. Pshenichnyi [The linearization method (1983; Zbl 0533.49024)]; convex programs do not assume differentiability of functions and are solved by a generalized gradient method of the third author [Minimization methods for nondifferentiable functions and their applications (1979; Zbl 0524.49002)]. Among special features, two extremal-volume ellipsoids can be constructed by solving convex programs of a special form.

MSC:

65K05 Numerical mathematical programming methods
90C10 Integer programming
90-04 Software, source code, etc. for problems pertaining to operations research and mathematical programming
90C30 Nonlinear programming

Software:

DISNEL; PLANNER; DISPRO
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] V. S. Mikhalevich, I. V. Sergienko, T. T. Lebedeva, et al., ?DISPRO application package for solving discrete programming problems,? Kibernetika, No. 3, 117?137 (1981).
[2] V. S. Mikhalevich, I. V. Sergienko, N. Z. Shor, et al., ?DISPRO-3 program package: purpose, classes of solvable problems, system and algorithmic software,? Kibernetika, No. 1, 56?71 (1985).
[3] V. S. Mikhalevich, I. V. Sergienko, V. A. Trubin, et al., ?Application package for solving large production-transportation planning problems (PLANER),? Kibernetika, No. 3, 57?71, 79 (1983).
[4] I. V. Sergienko, Mathematical Models and Methods for Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1988).
[5] V. S. Mikhalevich (ed.), Computational Methods for Selecting Optimal Design Solutions [in Russian], Naukova Dumka, Kiev (1977).
[6] O. V. Volkovich, V. A. Roshchin, and I. V. Sergienko, ?On models and methods of solution of integer quadratic programming problems,? Kibernetika, No. 3, 1?15 (1987). · Zbl 0658.90067
[7] O. V. Volkovich, ?Application of the method of sequential analysis of alternatives for the solution of integer quadratic programming problems,? in: Design and Development of Program Packages [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1987), pp. 40?44.
[8] V. S. Mikhalevich, V. A. Trubin, and N. Z. Shor, Optimization Problems of Production-Transportation Planning [in Russian], Nauka, Moscow (1986). · Zbl 0701.90025
[9] V. A. Trubin and F. A. Sharifov, ?Theoretical and experimental analysis of a problem with production capacity constraints,? in: Mathematical Models of Planning and Control in Complex Systems [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1986), pp. 8?14.
[10] V. A. Roshchin and I. V. Sergienko, ?An approach to the solution of the covering problem,? Kibernetika, No. 6, 65?69 (1984).
[11] V. A. Roshchin and I. V. Sergienko, ?A solution method for the partial covering problem,? Kibernetika, No. 1, 96?98 (1989).
[12] B. N. Pshenichnyi, Linearization Method [in Russian], Nauka, Moscow (1983).
[13] N. Z. Shor, Methods of Minimization of Nondifferentiable Functions and Their Applications [in Russian], Naukova Dumka, Kiev (1979). · Zbl 0524.49002
[14] A. M. Priyatel’, ?A method of allowing for constraints in a piecewise-linear programming problem,? in: Methods of Solution of Complex Mathematical Programming Problems [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1985), pp. 16?20.
[15] N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).
[16] S. K. Andrusenko, E. A. Nurminskii, and P. I. Stetsyuk, ?Numerical experiments with a new class of linear programming algorithms,? Zh. Vychisl. Mat. Mat. Fiz.,27, No. 3, 349?356 (1987).
[17] L. S. Lasdon, Optimization Theory for Large Systems, Macmillan, New York (1970). · Zbl 0224.90038
[18] Yu. A. Dan’ko and G. A. Potapchuk, ?Working with matrix data in application packages using the MIDAS file management system,? in: Design and Development of Program Packages [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1987), pp. 86?90.
[19] G. A. Potapchuk, ?An approach to data organization in problem-oriented file management systems,? in: Application Packages and Numerical Methods [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1988), pp. 48?52.
[20] G. A. Potapchuk, ?An approach to the development of the system component of optimization packages,? in: Mathematical and System Software for Discrete Optimization Problems [in Russian], Inst. Kiber. Akad. Nauk UkrSSR, Kiev (1989), pp. 42?47.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.