Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "constraint" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 127
Tytuł:
Minima in control problems with constraints
Autorzy:
Stefani, Gianna
Zezza, PierLuigi
Powiązania:
https://bibliotekanauki.pl/articles/1359682.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
state-control constraint
necessary
second order conditions
conjugate points
optimal control
sufficient conditions
Opis:
This paper is devoted to describing second order conditions in the framework of extremal problems, that is, conditions obtained by reducing the optimal control problem to an abstract one in a suitable Banach (or Hilbert) space. The studied problem includes equality constraints both on the end-points and on the state-control trajectory. The second goal is to give a complete description of necessary and sufficient second order conditions for weak local optimality by describing first the associated linear-quadratic problem and then by giving a conjugate point theory for this linear quadratic problem with constraints.
Źródło:
Banach Center Publications; 1995, 32, 1; 361-378
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A satisficing method of introducing the concepts of fuzzy goal and fuzzy constraints into the DEA
Autorzy:
Uemura, Y.
Powiązania:
https://bibliotekanauki.pl/articles/206699.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
DEA
fuzzy constraint
fuzzy goal
satisficing method
Opis:
Evaluation of efficiency of the DMUs (Decision Making Units) in a company can be carried out with the help of DEA (Data Envelopment Analysis). The efficiency calculated for a DMUo with the help of DEA is, however, higher than the maximum efficiency among the single object-single output results. It can be postulated that total efficiency is constrained between the limits thus obtained. Within this context we introduce the concepts of fuzzy goal and fuzzy constraints into the DEA formulation, propose the satisficing method following the precepts of the maximizing decision introduced by Bellman and Zadeh, and the improvement procedure for the satisficing solution using the dialogue with the DM over the tradeoff rate for two inputs, developed by Sakawa.
Źródło:
Control and Cybernetics; 1998, 27, 3; 465-469
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Second-order necessary conditions of the Kuhn-Tucker type in multiobjective programming problems
Autorzy:
Aghezzaf, B.
Powiązania:
https://bibliotekanauki.pl/articles/970055.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie obiektowe
efficient solutions
multiobjective programming
second-order constraint qualification
second-order necessary conditions
Opis:
In this paper, we are concerned with a multiobjective programming problem with inequality constraints. We develop second-order necessary condition of the Kuhn-Tucker type for effciency and prove that the condition holds under a. constraint qualification. Moreover, we give some conditions which ensure that the constraint qua,lifica.tion holds.
Źródło:
Control and Cybernetics; 1999, 28, 2; 213-224
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Declarativity in modelling and problem solving
Autorzy:
Niederliński, A.
Powiązania:
https://bibliotekanauki.pl/articles/205883.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
język symulacyjny
język wysokiego poziomu
optymalizacja kombinatoryczna
CHIP
CLP
combinatorial optimisation
constraint solving
declarative programming
high level language
logic programming
logic programming languages
Prolog
simulation language
Opis:
The paper discusses a new trend in the modelling software for combinatorial and mixed combinatorial-continuous decision problems. The trend, aiming at solving those problems by the simple activity of properly describing them, is best exemplified by a constantly inereasing spectrum of Constraint Logic Programming (CLP) languages. The first such language was Prolog. After a short historical survey concentrating mainly on Prolog, main characteristics of a modern, commercially successful CLP language - CHIP - are presented, discussed and illustrated. The CLP approach to problem solving is compared with traditional Operation Research approaches.
Źródło:
Control and Cybernetics; 2000, 29, 1; 325-339
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal control of semilinear elliptic equation with state constraint : maximum principle for minimizing sequence, regularity, normality, sensitivity
Autorzy:
Sumin, M.
Powiązania:
https://bibliotekanauki.pl/articles/205729.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
równanie eliptyczne
sensitivity
sterowanie optymalne
zasada maksimum
elliptic equation
Lipschitz continuity
maximum principle
minimizing sequence
normality
optimal control
parametric optimal control
pointwise state constraint
regularity
sequences
value function
Opis:
This article deals with state constrained optimal control problem for semilinear elliptic equation in a domain Omega. The state constraint is lumped on the compactum X contained in/implied by Omega n and contains a functional parameter q in C(X ). It is shown that any minimizing approximate solution (m.a.s.) in the sense of J. Warga satisfies the pointwise maximum principle (the maximum principle for m.a.s.) if the problem is meaningful, i.e., the value of the problem is finite. It is also shown that a condition of Slater's type is sufficient for the normality in the so-called "linear-convex" problem, and the normality of the problem for some fixed value of the parameter q in C(X ) implies the Lipschitz continuity of its value function in a neighborhood of q. The paper contains illustrative examples.
Źródło:
Control and Cybernetics; 2000, 29, 2; 449-472
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Contraintes, je vous haisme
Autorzy:
Sobczyński, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/1954379.pdf
Data publikacji:
2002
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
Oulipo
reguła formalna
Georges Perec
formal constraint
Opis:
Pracownia Literatury Potencjalnej (Oulipo) obchodziła w 2000r. czterdziestolecie swojej działalności, bijąc tym samym swoisty rekord długowieczności grup literackich wskali nie tylko francuskiej. Celem prac Oulipo jest tworzenie i znalezienie zastosowań dla tzw. contraintes. Już sam termin (czasami niezbyt udatnie tłumaczony na język polski jako rygor, ograniczenie, przymus) jest kłopotliwy i niejednoznaczny: chodzi o regułę literacką, która nie poddaje się kanonizacji i która przez czytelników uzanawana jest za ekstrawagancką, odrębną, czasem dziwaczną. Contraintes, zdaniem Pracowni, są w stanie urozmaicić klasyczny kanon zabiegów formalnych, jakimi posługuje się literatura. Twórczość pisarzy z kręgu Oulipo, długo uznawana za zjawisko marginalne, stała się w ostatnich latach przedmiotem zainteresowania literaturoznawców, w tym także badaczy, którzy próbują refleksji nad działalnością Pracowni nadać wymiar teoretyczny. Artykuł jest próbą podsumowania literackiego dorobku grupy, przedstawienia stanu najnowszych badań nad problematyką contrainte oraz wskazania kierunków, jakie w przyszłości należałoby w tych badaniach podjąć.
Źródło:
Roczniki Humanistyczne; 2002, 50, 5; 5-26
0035-7707
Pojawia się w:
Roczniki Humanistyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wyrok Sądu Metropolitalnego w Katowicach (c. Sobański) z 10.7.2003 z tytułu symulacji i przymusu
Autorzy:
Sobański, Remigiusz
Powiązania:
https://bibliotekanauki.pl/articles/662850.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Kardynała Stefana Wyszyńskiego w Warszawie
Tematy:
symulacja
przymus
simulation
constraint
Źródło:
Ius Matrimoniale; 2004, 15, 9; 231-240
1429-3803
2353-8120
Pojawia się w:
Ius Matrimoniale
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of IS/IT, process and constraint management in optimization of business processes
Autorzy:
Basl, J.
Powiązania:
https://bibliotekanauki.pl/articles/117962.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
information system
enterprise information system
enterprise resource planning (ERP)
business process optimization
constraint management
Opis:
The paper deals with business process based on the IS/ICT (information systems, information and communication technology) applications, mainly ERP (Enterprise Resource Planning) and APS (Advanced Planning and Scheduling) software packages, process and constraint management. The analysis of the current ERP and APS offer in the Czech market is presented. The second part of the paper deals with the principles of the innovation of IS/ICT in enterprise and with the approaches to the its effectiveness
Źródło:
Applied Computer Science; 2005, 1, 1; 93-106
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CP approach to design of steady-state flow of repetitive manufacturing processes in SME
Autorzy:
Wójcik, R.
Bocewicz, G.
Powiązania:
https://bibliotekanauki.pl/articles/118159.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
production planning
waiting-free schedules design
constraint logic programming
Opis:
Concurrent execution of work orders in the small and medium size enterprises (SME) imposes a necessity to consider many control problems concerning systems of repetitive concurrent manufacturing processes using common resources in mutual exclusion. In many cases a production system with a given structure of the processes resource requests can be seen as composed of subsystems with n cyclic processes sharing one resource. For given sets of possible values of the processes operation execution times a problem of finding schedules guaranteeing that no process waits for access to the common resources is considered. In particular for the assigned times of the operations execution a subproblem of finding all possible starting times of work orders execution for which waiting-free schedules exist has been formulated as a constraint programming (CP) problem. The starting times derived can be used as an alternative starting times of work orders execution in case of their possible delays. A state space of the problem’s solutions has been reduced using constraints based on the necessary and sufficient conditions for existence of a waiting-free n-process steady-state schedule. An illustrative example of Mozart-based software application to the solution of constraint logic programming problem considered has been presented.
Źródło:
Applied Computer Science; 2005, 1, 1; 201-218
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On robustness of set-valued maps and marginal value functions
Autorzy:
Hoffmann, Armin
Geletu, Abebe
Powiązania:
https://bibliotekanauki.pl/articles/729640.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
robust set; robust function; robust set-valued map; marginal value function; piecewise lower (upper) semi-continuous; approximatable function; approximatable set-valued map; regularity condition; extended Mangasarian-Fromovitz constraint qualification
Opis:
The ideas of robust sets, robust functions and robustness of general set-valued maps were introduced by Chew and Zheng [7,26], and further developed by Shi, Zheng, Zhuang [18,19,20], Phú, Hoffmann and Hichert [8,9,10,17] to weaken up the semi-continuity requirements of certain global optimization algorithms. The robust analysis, along with the measure theory, has well served as the basis for the integral global optimization method (IGOM) (Chew and Zheng [7]). Hence, we have attempted to extend the robust analysis of Zheng et al. to that of robustness of set-valued maps with given structures and marginal value functions. We are also strongly convinced that the results of our investigation could open a way to apply the IGOM for the numerical treatment of some class of parametric optimization problems, when global optima are required.
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2005, 25, 1; 59-108
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards CLP-based task-oriented DSS for SME
Autorzy:
Tomczuk, I.
Bzdyra, K.
Banaszak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/118215.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
decision support
constraint logic programming
production planning
modelling
scheduling
Opis:
Decision making supported by task-oriented software tools plays a pivotal role in a modern enterprises. That is because commercially available ERP systems are not able to respond in an interactive on-line/real-time mode. It means a new generation of DSS that enable a fast prototyping of production flows in multiproject environment as well as an integrated approach to a layout planning, production routing, batch-sizing and scheduling problems is needed. In that context, the constraint logic programming techniques allowing declarative representation of a decision making problem provide a quite attractive alternative. So, some issues regarding modelling of decision making and searching strategies development are discussed in the contribution. The results obtained are implemented in a software package supporting production flow planning in the SMEs. Illustrative example of the ILOG-based software application is provided.
Źródło:
Applied Computer Science; 2005, 1, 1; 181-200
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards dedicated decision support tools: CLP-based approach
Autorzy:
Banaszak, Z.
Józefczyk, J.
Powiązania:
https://bibliotekanauki.pl/articles/118061.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
decision support
constraint logic programming
production planning
modeling
scheduling
Opis:
Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in areas of integrated production planning. In that context, the CP can be considered as a well-suited framework for development of decision making software supporting small and medium size enterprises in the course of Production Process Planning (PPP). The problem considered regards of finding of computationally effective approach aimed at scheduling of a new project subject to constraints imposed by a multi–project environment. In other words, we are looking for an answer whether a given production order specified by its cost and completion time can be accepted in a given manufacturing system specified by available production capability, i.e., the time-constrained resources availability. The problem belongs to a class of multi-mode case project scheduling problems, where the problem of finding a feasible solution is NPcomplete. The aim of the paper is to present the CP modeling framework as well as to illustrate its application to decision making in the case of a new production order evaluation. So, the contribution emphasizes benefits derived from CPbased DSS and focuses on constraint satisfaction driven decision-making rather than on an optimal solution searching.
Źródło:
Applied Computer Science; 2005, 1, 1; 161-180
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Constraint-based scheduling in Oz/Mozart
Autorzy:
Sitek, P.
Wikarek, J.
Banaszak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/118013.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint programming
decision support
scheduling
Opis:
In this paper we present how scheduling problems can be solved in the concurrent constraint programming (CCP) language Oz. Oz is the first high- level constraint language, which offers programmable search, modularity, expressiveness and an interface to invent new constraints using C++. As an example of scheduling problem the job-shop scheduling problem with manpower resources representation was considered. The objective discussed here is the minimization of the makespan. Allocating manpower to the jobs is more complicated than allocating machines, as different jobs and operations require different manpower. This problem is strongly NP-hard. We proposed the constraint programming (CP) based approach to decision support in this environment. The most important features of CP are declarative problem modeling, allowing a clear separation between the problem statement (variables and constraints) and the resolution of the problem.
Źródło:
Applied Computer Science; 2006, 2, 1; 83-99
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CP-based decision support package for production flow planning - an SME perspective
Autorzy:
Bzdyra, K.
Tomczuk-Piróg, I.
Powiązania:
https://bibliotekanauki.pl/articles/1395582.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint logic programming
decision support
flow planning
constraint satisfaction problem (CSP)
Opis:
Solving complex, decision-making problems requires application of decision support systems. The best solving strategy can be defined for each particular problem. The strategy refers to a sequence solving elementary subproblems. The aim of the paper is to present the evaluating criterion to estimate the efficiency of searching strategies. The criterion proposed offers a possibility to estimate the time needed to solve a constraint satisfaction problem. An illustrative example is provided.
Źródło:
Applied Computer Science; 2006, 2, 1; 100-109
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementation of declarative framework for decision support system in scheduling problems
Autorzy:
Sitek, P.
Wikarek, J.
Powiązania:
https://bibliotekanauki.pl/articles/117767.pdf
Data publikacji:
2007
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint programming
decision support
scheduling
Opis:
Scheduling problems appear frequently at different levels of decisions. They are usually characterized by many types of constraints, which make them unstructured and difficult to solve (NP-complete). Traditional mathematical programming approaches are deficient because their representation of constraints is artificial (using 0-1 variables). Unlike traditional approaches, constraint logic programming (CLP) provides for a natural representation of heterogeneous constraints. In CLP we state the problem requirements by constraints; we do not need to specify how to meet these requirements. In this paper we propose a declarative framework for decision support system (DSS) for constrained search problems implemented by CLP and relational SQL database. We illustrate this concept by the implementation of a DSS for scheduling problems with external resources in different production organization environments.
Źródło:
Applied Computer Science; 2007, 3, 2; 69-86
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 127

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies