Mixed constraint in global and sequential hologram generation

2021 ◽  
Vol 60 (7) ◽  
pp. 1888
Author(s):  
Alejandro Velez-Zea ◽  
Roberto Torroba
Keyword(s):  
2021 ◽  
Vol 60 (2) ◽  
pp. 224
Author(s):  
Alejandro Velez-Zea
Keyword(s):  

Author(s):  
Ahmed Hamoud ◽  
Kirtiwant Ghadle ◽  
Priyanka Pathade

<p>In the present article, a mixed type transportation problem is considered. Most of the transportation problems in real life situation have mixed type transportation problem this type of transportation problem cannot be solved by usual methods. Here we attempt a new concept of Best Candidate Method (BCM) to obtain the optimal solution. To determine the compromise solution of balanced mixed fuzzy transportation problem and unbalanced mixed fuzzy transportation problem of trapezoidal and trivial fuzzy numbers with new BCM solution procedure has been applied. The method is illustrated by the numerical examples.</p>


Author(s):  
Andreas Müller ◽  
Offer Shai

There are two established approaches to represent constraints: the body-bar (BB) and the bar-joint (BJ) graph that can be used in machine theory. They are referred to as topological graphs as they describe the relation between members of a mechanism. It is known, however, that in many cases these graphs are not unique. Hence any method for kinematic analysis or mobility determination that is based on these topological graphs is prone to failures. In this paper a generalized and unified concept for the representation of constraints in mechanisms is introduced. It is first shown in which situations BB and BJ representations fail to correctly represent the mechanism. The novel constraint graph is then derived starting from the most general model of constrained rigid bodies. It is shown how BB and BJ graphs result as special cases. Therefore the new graph representation is called the ‘mixed graph’. It is further shown how this novel mixed constraint graph allows for computation of the correct generic (topological) mobility, and thus overcomes the problems of BB and BJ representations.


Author(s):  
Cheng Fang

Resistance to adoption of autonomous systems comes in part from the perceived unreliability of the systems. Concerns can be addressed by approaches that guarantee the probability of success. This is achieved in chance-constrained constraint programming (CC-CP) by imposing constraints required for success, and providing upper-bounds on the probability of violating constraints. This extended abstract reports on novel uncertainty representations to address problems prevalent in current methods.


2017 ◽  
Vol 16 (4) ◽  
pp. 6895-6902
Author(s):  
Nidhi Joshi ◽  
Surjeet Singh Chauhan (Gonder) ◽  
Raghu Raja

The present paper attempts to obtain the optimal solution for the fuzzy transportation problem with mixed constraints. In this paper, authors have proposed a new innovative approach for obtaining the optimal solution of mixed constraint fuzzy transportation problem. The method is illustrated using a numerical example and the logical steps are highlighted using a simple flowchart. As maximum transportation problems in real life have mixed constraints and these problems cannot be truly solved using general methods, so the proposed method can be applied for solving such mixed constraint fuzzy transportation problems to obtain the best optimal solutions.


2008 ◽  
Vol 227 (23) ◽  
pp. 9885-9897 ◽  
Author(s):  
Luca Bergamaschi ◽  
Massimiliano Ferronato ◽  
Giuseppe Gambolati

Sign in / Sign up

Export Citation Format

Share Document