Results 11 to 20 of about 4,487,147 (242)
Computer assisted mathematical programming [PDF]
, 1987 A Computer Assisted Mathematical Programming (Modelling) System (CAMPS) is described in this paper. The system uses program generator techniques for model creation and contrasts with earlier approaches which use a special purpose language to construct ...
Mitra, G, Lucas, CA
core +6 more sources
Duality in infinite dimensional linear programming [PDF]
Mathematical programming, 1992 We consider the class of linear programs with infinitely many variables and constraints having the property that every constraint contains at most finitely many variables while every variable appears in at most finitely many constraints. Examples include
H. Romeijn, Robert L. Smith, J. C. Bean
semanticscholar +2 more sources
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
, 1982 A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core +6 more sources
Generalized semi-infinite programming : a tutorial [PDF]
, 2008 This tutorial presents an introduction to generalized semi-infinite programming (GSIP) which in recent years became a vivid field of active research in mathematical programming.
Stein, O. +14 more
core +2 more sources
Ideal points in multiobjective programming [PDF]
, 1993 The main object of this paper is to give conditions under which a minimal solution to a problem of mathematical programming can be transformed into a minimum solution in the usual sense of the order relations, or in every case, conditions under which ...
Balbás, Alejandro +2 more
core +1 more source
On second order necessary conditions in infinite dimensional optimal control with state constraints
IEEE Conference on Decision and Control, 2019 This paper is devoted to second order necessary optimality conditions for control problems in infinite dimensions. The main novelty of our work is the presence of pure state constraints together with end point constraints, quite useful in the ...
H. Frankowska +2 more
semanticscholar +1 more source
Nauka ta progres transportuPurpose. Among various formulations of the optimal set partitioning (OSP) problem, dynamic variants—where optimization conditions change over time—are of particular interest due to their relevance for real-world applications.
E. M. Kiseleva +2 more
doaj +1 more source
Locally compactly Lipschitzian mappings in infinite dimensional programming
Bulletin of the Australian Mathematical Society, 1993 In this note we show that a subgradient multifunction of a locally compactly Lip-schitzian mapping satisfies a closure condition used extensively in optimisation theory.
B. Glover
semanticscholar +1 more source
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Copositive programming via semi-infinite optimization [PDF]
, 2013 Copositive programming (CP) can be regarded as a special instance of linear semi-infinite programming (SIP). We study CP from the viewpoint of SIP and discuss optimality and duality results.
Still, Georg +2 more
core +1 more source