Suchergebnisse - "((\"vector boolean programming problem\") OR (\"Vector Boolean programming problems\"))"

On stability and quasi-stability of a vector lexicographic quadratic boolean programming problem: On stability and quasi-stability of a vector lexicographic quadratic Boolean programming problem

Autoren: V.A. Emelichev V. Nikulin

Quelle: Journal of Numerical Analysis and Approximation Theory, Vol 30, Iss 1 (2001)

Schlagwörter: Sensitivity, stability, parametric optimization, QA1-939, Boolean programming, vector Boolean programming, stability, Mathematics

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1864560
https://doaj.org/article/43737cbc4dda4ac5ab6d3fce582d1632
https://doaj.org/article/f9dacab2eef744598eae30d3238b3252

On stability of a Pareto optimum of a vector Boolean programming problem

Autoren: V.N. Krichko V.A. Emelichev

Quelle: Discrete Mathematics and Applications. 9

Schlagwörter: Sensitivity, stability, parametric optimization, 0211 other engineering and technologies, Integer programming, Boolean programming, stability radius, quasi-stability radius, 02 engineering and technology, Pareto optimum, 0101 mathematics, 01 natural sciences, Multi-objective and goal programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1548652
https://doi.org/10.1515/dma.1999.9.6.607
http://www.degruyter.com/downloadpdf/j/dma.1999.9.issue-6/dma.1999.9.6.607/dma.1999.9.6.607.xml

On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero

Autoren: Emelichev, V.A. Gurevsky, E.E.

Quelle: Computer Science Journal of Moldova, Vol 14, Iss 2(41), Pp 207-218 (2006)
Computer Science Journal of Moldova 41 (2) 207-218

Schlagwörter: Dvector Boolean programming problem, Electronic computers. Computer science, 0211 other engineering and technologies, vector Boolean programming problem, quasi-stability radius, 02 engineering and technology, QA75.5-76.95, 0101 mathematics, Pareto set, 01 natural sciences, quasi-stability

Dateibeschreibung: application/pdf

Zugangs-URL: https://doaj.org/article/d539a8ff2ff841bfa530bc4c99d53421
https://ibn.idsi.md/vizualizare_articol/2330

Stability radius of an efficient solution to a vector quadratic problem of Boolean programming.

Autoren: Emelichev, V. A. Krichko, V. N.

Schlagwörter: optimal, partial criteria, efficient solution, unique, Multiobjective variational problems, Pareto optimality, applications to economics, etc, vector criterion, General equilibrium theory, Boolean programming, Pareto set, Multi-objective and goal programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1849231

On the radius of stability of a vector problem of linear Boolean programming.

Autoren: Emelichev, V.A. Krichko, V.N. Podkopaev, D.P.

Quelle: Discrete Mathematics & Applications. 2000, Vol. 10 Issue 1, p103. 6p.

Schlagwörter: *BOOLEAN algebra, *LINEAR programming

Aspects of stability for multicriteria quadratic problems of Boolean programming.

Autoren: Emelichev, Vladimir A. Nikulin, Yury V.

Quelle: Buletinul Academiei de Ştiinţe a Republicii Moldova: Matematica; 2018, Vol. 87 Issue 2, p30-40, 11p

Schlagwörter: BOOLEAN functions, QUADRATIC equations, PERTURBATION theory, STABILITY theory, INTEGER programming

Convex Relaxations of (0, 1)-Quadratic Programming

Autoren: Poljak, Svatopluk Wolkowicz, Henry

Quelle: Mathematics of Operations Research, 1995 Aug 01. 20(3), 550-561.

Zugangs-URL: https://www.jstor.org/stable/3690169

Stability Radius of a Lexicographic Optimum of a Vector Problem of Boolean Programming.

Autoren: V. A. Emelichev K. G. Kuzmin

Quelle: Cybernetics & Systems Analysis; Mar2005, Vol. 41 Issue 2, p215-223, 9p

Schlagwörter: MATHEMATICAL optimization, MATHEMATICAL analysis, MATHEMATICS, OPERATIONS research

Probability Bounds with Cherry Trees

Autoren: Bukszár, József Prékopa, András

Quelle: Mathematics of Operations Research, 2001 Feb 01. 26(1), 174-192.

Zugangs-URL: https://www.jstor.org/stable/3690442

Bilevel Biobjective Pseudo Boolean Programming Problems.

Autoren: Tuns (Bode), Oana

Quelle: Journal of Mathematical Modelling & Algorithms; Sep2012, Vol. 11 Issue 3, p325-344, 20p

On stability of a Pareto optimum of a vector Boolean programming problem.

Autoren: Emelichev, V.A. Krichko, V.N.

Quelle: Discrete Mathematics & Applications; 1999, Vol. 9 Issue 6, p607, 7p

Schlagwörter: BOOLEAN algebra, LINEAR programming, VECTOR algebra

AN INNOVATIVE APPROXIMATE SOLUTION METHOD FOR AN INTEGER PROGRAMMING PROBLEM.

Alternate Title: ІННОВАЦІЙНИЙ МЕТОД НАБЛИЖЕНОГО РОЗВ’ЯЗАННЯ ЗАДАЧІ ЦІЛОЧИСЛОВОГО ПРОГРАМУВАННЯ. (Ukrainian)

Autoren: K.Sh., Mamedov R.R., Niyazova

Quelle: Radio Electronics, Computer Science, Control; 2025, Issue 3, p195-205, 11p

Schlagwörter: PROBLEM solving

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study.

Autoren: Lima, Ricardo Grossmann, Ignacio

Quelle: Computational Optimization & Applications; Jan2017, Vol. 66 Issue 1, p1-37, 37p

Schlagwörter: QUADRATIC programming, BOOLEAN algebra, MIXED integer linear programming, COMBINATORICS, MATHEMATICAL reformulation

Using the NEOS Server for Solving Two Classes of Optimization Problems

Autoren: Halyna Bila Oleksandr Korchynskyy Petro Stetsyuk et al.

Quelle: Кібернетика та комп'ютерні технології, Iss 4, Pp 56-80 (2022)

Schlagwörter: Q300-390, neos solvers, stiefel's manifold, travelling salesman problem, optimization, Cybernetics, neos server, ampl

Zugangs-URL: https://doaj.org/article/4baaac5f6055403abed9d106c4df1dc4

On the global optimal solutions of continuous FRE programming problems.

Autoren: Ghodousian, A. Zal, S.

Quelle: Iranian Journal of Fuzzy Systems; Sep/Oct2024, Vol. 21 Issue 5, p51-69, 19p

Schlagwörter: FUZZY relational equations, TRIANGULAR norms, GLOBAL optimization

Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem: Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem

Autoren: Vladimir A. Emelichev Vitaly N. Krichko Yury V. Nikulin

Quelle: Computer Science Journal of Moldova, Vol 10, Iss 2(29), Pp 136-142 (2002)
Computer Science Journal of Moldova, Vol 10, Iss 3(30), Pp 320-328 (2002)

Schlagwörter: multiple criterion Boolean programming, vector MINMAX Boolean programming problem, Electronic computers. Computer science, efficient solution, Sensitivity, stability, parametric optimization, Pareto optimal, Vector MINMAX Boolean programming problem, minmax partial criteria, QA75.5-76.95, Boolean programming, stability radius, Minimax problems in mathematical programming, Multi-objective and goal programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1810318
https://zbmath.org/1960734
https://doaj.org/article/b5f14a09b1b74f8e84d6d22a0fb00419
https://doaj.org/article/0d7b4ba24a7d4df68d206a5ecb41452c

A Discrete-time Projection Neural Network for Solving Convex Quadratic Programming Problems with Hybrid Constraints.

Autoren: Liu, Fengqiu Wang, Jianmin Zhang, Hongxu et al.

Quelle: International Journal of Control, Automation & Systems; Jan2023, Vol. 21 Issue 1, p328-337, 10p

A covering-based algorithm for resolution of linear programming problems with max-product bipolar fuzzy relation equation constraints.

Autoren: Molai, Ali Abbasi

Quelle: Journal of Mathematical Modeling (JMM); Dec2023, Vol. 11 Issue 4, p709-730, 22p

Schlagwörter: EQUATIONS, ALGORITHMS, PROBLEM solving

A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM: A method for generating all the efficient solutions of a 0-1 multi-objective linear programming problem

Autoren: F. Hosseinzadeh Lotfi N. Shoja Ghasem Tohidi et al.

Quelle: Asia-Pacific Journal of Operational Research. 21:127-139

Schlagwörter: 0-1 Multi-Objective Linear Programming, efficient solution, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Boolean programming, 02 engineering and technology, Multi-objective and goal programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2134953
https://doi.org/10.1142/s0217595904000096
https://dblp.uni-trier.de/db/journals/apjor/apjor21.html#JahanshahlooLST04
https://doi.org/10.1142/S0217595904000096
https://www.worldscientific.com/doi/abs/10.1142/S0217595904000096
https://ideas.repec.org/a/wsi/apjorx/v21y2004i01ns0217595904000096.html

Bilevel Optimization Problems of Distribution of Interbudgetary Transfers Under Given Limitations.

Autoren: Sergienko, I. V. Semenova, N. V. Semenov, V. V.

Quelle: Cybernetics & Systems Analysis; Nov2019, Vol. 55 Issue 6, p905-913, 9p

Schlagwörter: INTEGER programming, MATHEMATICAL models, INTEGERS