Two Methods for Construction of Suboptimistic and Subpessimistic Solutions of the Interval Problem of Mixed-Boolean Programming

Radio Electronics, Computer Science, Control
doi 10.15588/1607-3274-2018-3-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Zaporizhzhia National Technical University

Related search

Some Properties of Interval Quadratic Programming Problem

International Journal of Systems Science and Applied Mathematics
2017English

Two Formulations of Discriminant Problem for Interval Data

Transactions of the Institute of Systems, Control and Information Engineers
1989English

Composite Viscosity Methods for Common Solutions of General Mixed Equilibrium Problem, Variational Inequalities and Common Fixed Points

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2015English

On the Construction of an Approximate Optimal Solution for Geometric Programming Problem

Transactions of the Society of Instrument and Control Engineers
1984English

On Numerical Methods for One Problem of Mixed Type

Mathematical Modeling and Analysis
ModelingAnalysisSimulation
2001English

Mixed and Stabilized Finite Element Methods for the Obstacle Problem

SIAM Journal on Numerical Analysis
Computational MathematicsApplied MathematicsNumerical Analysis
2017English

Existence of X-Optimal Solution of Fractional Programming Problem With Interval Parameters

Journal of Computer Science & Computational Mathematics
2015English

Implicit Interval Multistep Methods for Solving the Initial Value Problem

Computational Methods in Science and Technology
2002English

On the Analysis of Simple Genetic Programming for Evolving Boolean Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy