检索结果-内蒙古大学图书馆

7th International Russian Automation Conference, RusAutoCon 2024

作者： Groppen, V.O. Tuayeva, I.V. 44 Nikolaev Str Vladikavkaz362021 Russia

ISBN: (数字)9783031824944

ISBN: (纸本)9783031824937

Proposed is an enumeration technology based on search of local optimum of extremal problems with discrete variables as well as numerical values of integrals, the roots of equations, and extreme values of equations for the problems with continues variables. The aim is to propose an enumeration technology for obtaining numerical solutions of acceptable quality for a wide range of problems in minimal time to find a solution. This approach includes possibility of predictive procedures usage to reduce the time of intermediate calculations, but it does not guarantee any gain in total running time, since part of this time is spent on searching for predictive dependencies. Nevertheless, it is shown that as the enumeration volume increases, the efficiency of the proposed approach also increases. It has been analytically proved and experimentally confirmed that, in comparison with the sequential search leading to the same quality of solution, the upper bound for the gain in running time for the problems with continues variables is equal to two. All descriptions of this approach are illustrated with examples and with statistical results of experimental verification of the effectiveness of this approach in relation to problems with discrete and continuous variables. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Analyze of efficiency Brute force Continuous variables discrete programming Enumeration Local optimum Predictive procedure

来源：评论

学校读者我要写书评

暂无评论

Decomposition of the Model of Optimal Well Placement at Gas Fields 22

Decomposition of the Model of Optimal Well Placement at Gas ...

引用

22nd World Congress of the International Federation of Automatic Control (IFAC)

作者： Latipov, Ayzat Ermolaev, Alexander VA Trapeznikov Inst Control Sci Lab 82 Moscow Russia Gubkin Univ Gasfield Dept Moscow Russia

ISBN: (纸本)9781713872344

The work is devoted to solving one of the important problems of design of gas field development - the problem of optimal placement of producing wells. We consider a method for solving the problem of dimensionality, which arose when the model became more complex due to the addition of reservoir filtration properties. The results of applying the method are presented. Copyright (c) 2023 The Authors.

关键词： placement wells gas reserves discrete programming gas fields decomposition geological model.

来源：评论

学校读者我要写书评

暂无评论

Decomposition of the Model of Optimal Well Placement at Gas Fields

引用

IFAC-PapersOnLine 2023年第2期56卷 2644-2649页

作者： Ayzat Latipov Alexander Ermolaev Lab 82 V.A. Trapeznikov Institute of Control Sciences Moscow Russia Gasfield Department Gubkin University Moscow Russia

关键词： placement wells gas reserves discrete programming gas fields decomposition geological model

来源：评论

学校读者我要写书评

暂无评论

Statement and Solution of Multicriteria Tasks of Database Modular Block-Schemes Development

引用

INTERNATIONAL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS 2020年第1期66卷 237-242页

作者： Wojcik, Waldemar Kalizhanova, Aliya Akhmetov, Sultan Nabiyeva, Gulnaz Kozbakova, Ainur Lublin Tech Univ Lublin Poland Al Farabi Kazakh Natl Univ Inst Informat & Computat Technol CS MES RK Alma Ata Kazakhstan Almaty Univ Power Engn & Telecommun Alma Ata Kazakhstan

The paper considers developed and offered an effective algorithm for solving the block-symmetrical tasks of polynomial computational complexity of data processing modular block-schemes designing. Currently, there are a large number of technologies and tools that allow you to create information systems of any class and purpose. To solve the problems of designing effective information systems, various models and methods are used, in particular, mathematical discrete programming methods. At the same time, it is known that such tasks have exponential computational complexity and can not always be used to solve practical problems. In this regard, there is a need to develop models and methods of the new class, which provide the solution of applied problems of discrete programming, aimed at solving problems of large dimensions. The work has developed and proposed block-symmetric models and methods as a new class of discrete programming problems that allow us to set and solve applied problems from various spheres of human activity. The issues of using the developed models are considered. and methods for computer-aided design of information systems (IS).

关键词： models and methods discrete programming data processing system multicriteria problem

来源：评论

学校读者我要写书评

暂无评论

REDUCING TWO-STAGE PROBABILISTIC OPTIMIZATION PROBLEMS WITH discrete DISTRIBUTION OF RANDOM DATA TO MIXED-INTEGER programming PROBLEMS

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2014年第5期50卷 679-692页

作者： Norkin, V. I. Kibzun, A. I. Naumov, A. V. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine Moscow Inst Aviat Technol Moscow Russia

We consider two-stage stochastic programming models with quantile criterion as well as models with a probabilistic constraint on the random values of the objective function of the second stage. These models allow us to formalize the requirements for the reliability and safety of the system being optimized and to optimize system's performance under extreme conditions. We propose a method of equivalent transformation of these models under discrete distribution of random parameters to mixed-integer programming problems. The number of additional integer (Boolean) variables in these problems equals to the number of possible values of the vector of random parameters. The obtained mixed optimization problems can be solved by powerful standard discrete optimization software. To illustrate the approach, the results of numerical experiment for the problem of small dimension are presented.

关键词： stochastic programming two-stage problems quantile programming probabilistic constraints deterministic equivalent mixed-integer optimization problems discrete programming

来源：评论

学校读者我要写书评

暂无评论

Theoretical and algorithmic results for a class of hierarchical fleet mix problems

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年第3期198卷 741-747页

作者： Cambini, Riccardo Riccardi, Rossana Univ Pisa Dept Stat & Appl Math Fac Econ I-56124 Pisa Italy

In this paper a workforce model is studied from both a theoretical and an algorithmic point of view. In the considered hierarchical model workforce units can be substituted by higher qualified ones;external workforce can also be hired to cover low qualified jobs. An exact recursive solution algorithm is proposed to solve the problems and its efficiency is improved by means of cut conditions and discrete convexity properties. Finally, the results of a computational test are provided. (C) 2008 Elsevier B.V. All rights reserved.

关键词： discrete programming discrete convexity Optimal fleet mix

来源：评论

学校读者我要写书评

暂无评论

Optimization of slabs using object oriented programming

引用

COMPUTERS & STRUCTURES 2004年第9-10期82卷 741-752页

作者： Al-Assaf, A Saffarini, HS Univ Jordan Amman 1942 Jordan

This paper discusses the application of Object-oriented programming (OOP) to the optimization of concrete slabs. This is achieved by combining: modeling, structural analysis, concrete design, cost estimation and discrete optimization together with data on cost of systems and materials. The user gets the optimal design parameters, steel topology, optimal slab system and least costs. The paper describes the overall design of the software system as well as some programming details and strategies. Inheritance and the repository model are utilized in the optimization of slabs. The unified modeling language (UML) notation is adopted. The advantages of using OOP over structured programming are discussed with particular reference to the software developed in this research. A case study on the selection of optimal system among common slab systems is briefly shown. (C) 2004 Elsevier Ltd. All rights reserved.

关键词： optimization concrete slab structure UML object-oriented programming (OOP) discrete programming repository model

来源：评论

学校读者我要写书评

暂无评论

Competitive acquisition of prioritizable capacity-based ancillary services

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2004年第1期19卷 569-576页

作者： Chicco, G Gross, G Politecn Torino Dipartimento Ingn Elettr Ind I-10129 Turin Italy Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

The rational buyer procedure provides the competitive procurement of capacity-based ancillary services (AS) in unbundled markets by the independent grid operator (IGO). The capacity-based AS are prioritized in order of ascending response times. Prioritization allows substitutability of the AS by automatically making the unused capacity of a higher priority AS usable for any lower priority AS without the need of submitting additional offers. We develop an efficient scheme for the rational buyer procedure for the acquisition of the prioritizable capacity-based AS. The scheme allows the simultaneous determination of the successful offers in the multiauction procedure through the effective deployment of discrete programming notions and the exploitation of the structural characteristics of the formulation. A key feature is the incorporation of physical constraints such as capacity, ramp-rate, and interzonal constraints. The use of bounding techniques combined with procedures for the quick detection of infeasible combinations of the offer prices and the identification of avoidable calculations leads to reducing the computational burden. The effectiveness and computational efficiency of the scheme are illustrated with representative numerical results including case studies based on the IEEE 118-bus network.

关键词： ancillary service provision discrete programming independent grid operator prioritizable capacity-based services ramp-rate constraints rational buyer simultaneous auctions

来源：评论

学校读者我要写书评

暂无评论

Introduction of a new class of variables to discrete and integer programming problems

引用

ANNALS OF OPERATIONS RESEARCH 1999年 86卷 39-51页

作者： Hajian, MT Rodosek, R Richards, B Univ London Imperial Coll Sci Technol & Med William Penny Lab London SW7 2AZ England

In formulating a combinatorial optimisation problem (COP) using discrete or Integer programming (IP) modelling techniques, the modeller is restricted to use only certain predefined discrete variables and sets which are linked by sets of linear equality and inequality constraints. Definition of many COPs includes restrictions in which the use of disequality (DI) constraints in their mathematical representation is inevitable. To represent this type of constraint a number of binary variables and extra constraints are usually introduced, which lead to an increase in the size of the model in terms of variables and constraints. In this paper, we introduce a new class of discrete variables which enables the modeller to represent DI constraints more efficiently in the mathematical formulation of a combinatorial optimisation problem. We have also introduced a new branching scheme to the conventional simplex based Branch and Bound (B & B) algorithm in order to deal with this type of variables. To study the effect of these variables, we modelled and solved a set of five classic problems, first using conventional MP variables and second, exploiting the new proposed variables, and compared the results. The empirical results show a promising improvement on the performance of the B & B algorithm. The contribution of this paper is (1) the introduction of a new class of discrete variables which can help to build smaller models, and (2) new branching schemes on these variables that can improve the B & B performance.

关键词： mathematical modelling discrete programming constraint logic programming dis-equality constraints branch and bound

来源：评论

学校读者我要写书评

暂无评论

A BOUND-IMPROVING APPROACH TO discrete programming-PROBLEMS

引用

MATHEMATICAL programming 1994年第2期66卷 205-209页

作者： BARCIA, P COELHO, JD 1. Department of Economics Travessa Estevao Pinto Universidade Nova de Lisboa Campolide P-1000 Lisboa Portugal

This note deals with the extension of the bound-improving sequence idea to general discrete programming problems.

关键词： discrete programming LAGRANGEAN DUALITY

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：