Open Access
Mixed Integer Nonlinear Programming.
Christodoulos A. Floudas
- 01 Jan 2009
pp 2234-2247
264
TL;DR: An electronic watch having a multiple of modes includes mode selection means operable from the outside and a plurality of external operating buttons for modifying the contents of indication of the watch or for issuing an operational command in each mode.
read more
Abstract: An electronic watch having a multiple of modes includes mode selection means operable from the outside and a plurality of external operating buttons for modifying the contents of indication of the watch or for issuing an operational command in each mode. Auxiliary indication means is provided directly with the mode selection means. Alternatively, the auxiliary indication means may be provided separately from the mode selection means but in an interlocked fashion with it. The indication surface of the auxiliary indication means carries at a position corresponding to each of the external operating buttons a symbol or characters which represent the function of said each of the external operating buttons in each selected mode.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Decomposition Techniques in Mathematical Programming: Engineering and Science Applications
Antonio J. Conejo
- 10 Jan 2006
TL;DR: Decomposition in Linear Programming: Complicating Constraints, Duality, and Local Sensitivity Analysis.
633
Non-convex mixed-integer nonlinear programming: A survey
Samuel Burer,Adam N. Letchford +1 more
TL;DR: In this paper, the authors survey the literature on non-convex mixed-integer nonlinear programs, discussing applications, algorithms, and software, and special attention is paid to the case in which the objective and constraint functions are quadratic.
631
Group Sparse Beamforming for Green Cloud-RAN
TL;DR: This paper proposes a new framework to design a green Cloud-RAN, which is formulated as a joint RRH selection and power minimization beamforming problem, and proposes a greedy selection algorithm, shown to provide near-optimal performance.
565
•Posted Content
Group Sparse Beamforming for Green Cloud-RAN
TL;DR: In this paper, the authors proposed a new framework to design a green cloud radio access network, which is formulated as a joint RRH selection and power minimization beamforming problem, and the proposed algorithms significantly reduce the network power consumption and demonstrate the importance of considering the transport link power consumption.
348
Joint Trajectory and Resource Allocation Design for Energy-Efficient Secure UAV Communication Systems
TL;DR: The introduction of a jammer UAV facilitates a highly flexible trajectory design of the information UAV which is critical to improving the system energy efficiency and the proposed design can focus the artificial noise on eavesdroppers offering a strong security mean to the system.
269
References
Integer and Combinatorial Optimization: Nemhauser/Integer and Combinatorial Optimization
George L. Nemhauser,Laurence A. Wolsey +1 more
- 16 Jun 1988
Abstract: FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory. Computational Complexity. Polynomial-Time Algorithms for Linear Programming. Integer Lattices. GENERAL INTEGER PROGRAMMING. The Theory of Valid Inequalities. Strong Valid Inequalities and Facets for Structured Integer Programs. Duality and Relaxation. General Algorithms. Special-Purpose Algorithms. Applications of Special- Purpose Algorithms. COMBINATORIAL OPTIMIZATION. Integral Polyhedra. Matching. Matroid and Submodular Function Optimization. References. Indexes.
4.4K
•Book
Methods and applications of interval analysis
Ramon E. Moore
- 01 Jan 1987
TL;DR: Finite representations Finite evaluation Finite convergence Computable sufficient conditions for existence and convergence Safe starting regions for iterative methods.
3.6K
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
TL;DR: For nonlinear programming problems which are factorable, a computable procedure for obtaining tight underestimating convex programs is presented to exclude from consideration regions where the global minimizer cannot exist.
2.4K
Generalized Benders decomposition
TL;DR: In this paper, the extremal value of the linear program as a function of the parameterizing vector and the set of values of the parametric vector for which the program is feasible were derived using linear programming duality theory.
2.3K
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
TL;DR: An outer-approximation algorithm is presented for solving mixed-integer nonlinear programming problems of a particular class and a theoretical comparison with generalized Benders decomposition is presented on the lower bounds predicted by the relaxed master programs.